Merge pull request AllAlgorithms#4 from RanadeepPolavarapu/master

abranhe · web-flow · commit 1db8c55cc66b · 2018-10-01T23:56:18.000-04:00
feat(searches): add linear and binary search
diff --git a/searches/binary_search.py b/searches/binary_search.py
@@ -0,0 +1,26 @@
+def binarySearch(arr, l, r, x): # l is left, r is right, x is search item
+    if r >= l:
+
+        mid = l + (r - l)/2
+
+        # If element is present at the middle itself
+        if arr[mid] == x:
+            return mid
+
+        # If element is smaller than mid, then it
+        # can only be present in left subarray
+        elif arr[mid] > x:
+            return binarySearch(arr, l, mid-1, x)
+
+        # Else the element can only be present
+        # in right subarray
+        else:
+            return binarySearch(arr, mid+1, r, x)
+
+    else:
+        # Element is not present in the array
+        return -1
+
+# Tests
+result = binarySearch([ 2, 3, 4, 10, 40 ], 0, len(arr)-1, 10)
+print(result)
diff --git a/searches/linear_search.py b/searches/linear_search.py
@@ -0,0 +1,9 @@
+def linear_search(arr, item):
+    for i in range(len(arr)):
+        if arr[i] == item:
+            return i
+    return -1
+
+# Tests
+
+print(search([1,2,3,4,5], 3))
