Implementation of Binary and Sequential Search is done via Python.

Author: sanjaypradeep

Search Technique/BinarySearch.py

@@ -0,0 +1,42 @@
+__author__ = 'Sanjay'
+
+
+def binarySearch(alist, item):
+    first = 0
+    last = len(alist)-1
+    found = False
+
+    while first<=last and not found:
+        midpoint = (first + last)//2
+        if alist[midpoint] == item:
+            found = True
+        else:
+            if item < alist[midpoint]:
+                last = midpoint-1
+            else:
+                first = midpoint+1
+
+    return found
+
+
+#2nd - Recursive binary search Method
+def binarySearch2(alist, item):
+    if len(alist) == 0:
+        return False
+    else:
+        midpoint = len(alist)//2
+        if alist[midpoint]==item:
+          return True
+        else:
+            if item<alist[midpoint]:
+                return binarySearch(alist[:midpoint],item)
+            else:
+                return binarySearch(alist[midpoint+1:],item)
+
+
+
+if __name__ == '__main__':
+    testlist = [0, 1, 2, 8, 13, 17, 19, 32, 42,]
+    print(binarySearch(testlist, 3))
+    print(binarySearch(testlist, 13))
+

Search Technique/SequentialSearch.py

@@ -0,0 +1,58 @@
+__author__ = 'Sanjay'
+
+
+def seqSearch(aList, item):
+    pos =0
+    found = False
+
+    while pos<len(aList) and not found:
+        if aList[pos] == item:
+            found = True
+        else:
+            pos = pos +1
+    return found
+
+#as per book
+def sequentialSearch(alist, item):
+    pos = 0
+    found = False
+
+    while pos < len(alist) and not found:
+        if alist[pos] == item:
+            found = True
+        else:
+            pos = pos+1
+
+    return found
+
+#sequential search for a ordered list.
+
+    def orderedSequentialSearch(alist, item):
+        pos = 0
+        found = False
+        stop = False
+        while pos < len(alist) and not found and not stop:
+            if alist[pos] == item:
+                found = True
+            else:
+                if alist[pos] > item:
+                    stop = True
+                else:
+                    pos = pos+1
+
+            return found
+
+	testlist = [0, 1, 2, 8, 13, 17, 19, 32, 42,]
+	print(orderedSequentialSearch(testlist, 3))
+	print(orderedSequentialSearch(testlist, 13))
+
+
+
+
+if __name__ == '__main__':
+    s= [1,2,32,42,12,4,3,45,454]
+    print(seqSearch(s,45))
+
+    testlist = [1, 2, 32, 8, 17, 19, 42, 13, 0]
+    print(sequentialSearch(testlist, 3))
+    print(sequentialSearch(testlist, 13))