Merge pull request #156 from mahesdwivedi/master

binary search using python

search/binary_search/python/binary.py

@@ -0,0 +1,34 @@
+def binarySearch(arr, l, r, x): 
+
+    while l <= r: 
+
+        mid = l + (r - l)//2; 
+
+
+        if arr[mid] == x: 
+            return mid 
+
+
+        elif arr[mid] < x: 
+            l = mid + 1
+
+
+        else: 
+            r = mid - 1
+
+
+
+    return -1
+
+
+
+arr = [ 2, 3, 4, 10, 40 ] 
+x = 10
+
+
+result = binarySearch(arr, 0, len(arr)-1, x) 
+
+if result != -1: 
+    print ("Element is present at index ",result) 
+else: 
+    print ("Element is not present in array")