added jumpSearch Algorithm

Author: skillmaker-dev

Algorithms.NET.Debug/Program.cs

@@ -15,6 +15,7 @@
 //Console.WriteLine(Algorithms.NET.Searching.BinarySearch.BinarySearchAlgorithm.SearchIterative(0, unsortedAsc));
 
 Console.WriteLine(Algorithms.NET.Searching.TernarySearch.TernarySearchAlgorithm.Search(8, unsortedAsc));
+Console.WriteLine(Algorithms.NET.Searching.JumpSearch.JumpSearchAlgorithm.Search(0, unsortedAsc));
 
 //foreach (var item in sortedDesc)
 //{
@@ -34,7 +35,7 @@
 //}
 
 //var sortingBenchmarkSummary = BenchmarkRunner.Run<SortingBenchmark>();
-var searchingBenchmarkSummary = BenchmarkRunner.Run<SearchingBenchmark>();
+//var searchingBenchmarkSummary = BenchmarkRunner.Run<SearchingBenchmark>();
 
 
 

Algorithms.NET.Debug/SearchingBenchmark.cs

@@ -35,5 +35,8 @@ public SearchingBenchmark()
 
         [Benchmark]
         public void TernarySearchRecursive() => Algorithms.NET.Searching.TernarySearch.TernarySearchAlgorithm.Search(0, _sortedList);
+
+        [Benchmark]
+        public void JumpSearch() => Algorithms.NET.Searching.JumpSearch.JumpSearchAlgorithm.Search(0, _sortedList);
     }
 }

Algorithms.NET/Searching/JumpSearch/JumpSearchAlgorithm.cs

@@ -0,0 +1,38 @@
+using System;
+using System.Collections.Generic;
+using System.Text;
+
+namespace Algorithms.NET.Searching.JumpSearch
+{
+    public class JumpSearchAlgorithm
+    {
+        /// <summary>
+        /// Search an item in a list using JumpSearch algorithm, Time complexity of O(sqrt n).
+        /// </summary>
+        /// <param name="item">Item to search for</param>
+        /// <param name="sortedList">Sorted list in which we want to search.</param>
+        /// <returns>Index of item if found, Otherwise returns -1.</returns>
+        public static int Search(double item,List<double> sortedList)
+        {
+            int blockSize = (int)Math.Sqrt(sortedList.Count);
+
+            int start = 0;
+            int next = blockSize;
+
+            while(start < sortedList.Count && sortedList[next - 1] < item )
+            {
+                start = next;
+                next += blockSize;
+
+                if(next > sortedList.Count)
+                    next = sortedList.Count;
+            }
+
+            for(int i = start;i<next;i++)
+                if(sortedList[i] == item)
+                    return i;
+
+            return -1;
+        }
+    }
+}