Chnaged linear Search from generics to double

Author: skillmaker-dev

Algorithms.NET.Debug/Program.cs

@@ -36,8 +36,8 @@
 
 
 
-var sortingBenchmarkSummary = BenchmarkRunner.Run<SortingBenchmark>();
-//var searchingBenchmarkSummary = BenchmarkRunner.Run<SearchingBenchmark>();
+//var sortingBenchmarkSummary = BenchmarkRunner.Run<SortingBenchmark>();
+var searchingBenchmarkSummary = BenchmarkRunner.Run<SearchingBenchmark>();
 
 
 

Algorithms.NET/Searching/LinearSearch/LinearSearchAlgorithm.cs

@@ -9,15 +9,14 @@ public class LinearSearchAlgorithm
         /// <summary>
         /// Search an item in a list using linearSearch algorithm, Time complexity of O(n).
         /// </summary>
-        /// <typeparam name="T">Type of items in list</typeparam>
         /// <param name="item">Item to search for.</param>
         /// <param name="list">List in which we want to search.</param>
         /// <returns>Index of item if found, Otherwise returns -1.</returns>
-        public static int Search<T>(T item,List<T> list) where T : IComparable
+        public static int Search(double item,List<double> list)
         {
             for(int i = 0;i< list.Count;i++)
             {
-                if (list[i].Equals(item))
+                if (list[i] == item)
                     return i;
             }