Added LinearSearch algorithm

Author: skillmaker-dev

Algorithms.NET.Debug/SearchingBenchmark.cs

@@ -0,0 +1,36 @@
+using BenchmarkDotNet.Attributes;
+using System;
+using System.Collections.Generic;
+using System.Linq;
+using System.Text;
+using System.Threading.Tasks;
+
+namespace Algorithms.NET.Debug
+{
+    [MemoryDiagnoser]
+    public class SearchingBenchmark
+    {
+        private readonly List<int> _list = new();
+        private readonly List<double> _sortedList = new();
+        public SearchingBenchmark()
+        {
+            Random random = new();
+            for(int i = 0; i <= 10000; i++)
+            {
+                _list.Add(random.Next(1000));
+                _sortedList.Add(i);
+            }
+        }
+
+        //Here we test the worst case scenario
+
+        [Benchmark]
+        public void LinearSearch() => Algorithms.NET.Searching.LinearSearch.LinearSearchAlgorithm.Search(10000,_sortedList);
+
+        [Benchmark]
+        public void BinarySearchRecursive() => Algorithms.NET.Searching.BinarySearch.BinarySearchAlgorithm.SearchRecursive(0, _sortedList);
+
+        [Benchmark]
+        public void BinarySearchIterative() => Algorithms.NET.Searching.BinarySearch.BinarySearchAlgorithm.SearchIterative(0, _sortedList);
+    }
+}

Algorithms.NET/Searching/LinearSearch/LinearSearchAlgorithm.cs

@@ -0,0 +1,27 @@
+using System;
+using System.Collections.Generic;
+using System.Text;
+
+namespace Algorithms.NET.Searching.LinearSearch
+{
+    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
+        {
+            for(int i = 0;i< list.Count;i++)
+            {
+                if (list[i].Equals(item))
+                    return i;
+            }
+
+            return -1;
+        }
+    }
+}