linear search code and readme added

Author: me-shaon

Searching/Linear Search/README.md

@@ -0,0 +1,29 @@
+# Linear Search
+
+**Linear search** is a very simple search algorithm. In this type of search, a sequential search is made over all items one by one. Every item is checked and if a match is found then that particular item is returned, otherwise the search continues till the end of the data collection.
+
+![Linear Search](Linear_search.gif)
+
+
+#### Python Implementation
+
+Though it is very easy in python to check for an item's existence in a list by:
+
+`item in list`
+
+and finding an item's index by:
+
+`list.index(item)`
+
+but sometimes you might need to do some customization on the searching algorithm. Like- *'finding the last occurrence of the item in the list'* etc. This linear search implementation will help you to do that.
+
+#### Complexity Analysis
+- Worst Case - O(n)
+- Best Case - O(1)
+- Average Case - O(n)
+- Space Complexity - O(n)
+
+
+### More on this topic
+- https://en.wikipedia.org/wiki/Linear_search
+- https://www.tutorialspoint.com/data_structures_algorithms/linear_search_algorithm.htm

Searching/Linear Search/linear_search.gif

@@ -0,0 +1,5 @@
+def linearSearch(item, item_list):
+    for index, val in enumerate(item_list):
+        if val == item:
+            return True #You can return the index of the found element by 'return index'
+    return False

Searching/Linear Search/search.py

@@ -0,0 +1,9 @@
+from search import linearSearch
+
+hayStack = ['book','pencil','pen','note book','sharpener','rubber']
+needle = input('What do you want to find: ')
+
+if linearSearch(needle, hayStack):
+    print('Found')
+else:
+    print('Not Found')