Linear Search

Author: Shikha-code36

README.md

@@ -21,4 +21,5 @@ Data Structures and Algorithms Patterns implemented in Python.
     - [x] [Depth First Search](Graphs/dfs.py)
 - [x] [Searching Alogorithms](Searching-Algo)
     - [x] [Binary Search](Searching-Algo/binarysearch.py)
+    - [x] [Linear Search](Searching-Algo/linearsearch.py)
 

Searching-Algo/linearsearch.py

@@ -0,0 +1,13 @@
+'''
+                                Linear Search 
+Linear search is also called as sequential search algorithm. It is the simplest searching algorithm. In Linear search, we simply traverse the list completely and match each element of the list with the item whose ___location is to be found. If the match is found, then the ___location of the item is returned; otherwise, the algorithm returns NULL.
+'''
+
+def linearsearch(n,t):
+    for i in range(len(n)):
+        if t==n[i]:
+            return i
+    return -1
+
+a = [1,2,4,5,8]
+print(linearsearch(a,8)) #4