Merge pull request codehouseindia#475 from ankit10126/patch-1

codehouseindia · web-flow · commit a136fb4edc1f · 2020-10-09T16:27:15.000+05:30
Create binary search.py
diff --git a/binary search.py b/binary search.py
@@ -0,0 +1,41 @@
+#https://www.facebook.com/permalink.php?story_fbid=2439544126339393&id=100008514873543
+#subscibe by code House
+# Iterative Binary Search Function 
+# It returns index of x in given array arr if present, 
+# else returns -1 
+def binary_search(arr, x): 
+    low = 0
+    high = len(arr) - 1
+    mid = 0
+  
+    while low <= high: 
+  
+        mid = (high + low) // 2
+  
+        # Check if x is present at mid 
+        if arr[mid] < x: 
+            low = mid + 1
+  
+        # If x is greater, ignore left half 
+        elif arr[mid] > x: 
+            high = mid - 1
+  
+        # If x is smaller, ignore right half 
+        else: 
+            return mid 
+  
+    # If we reach here, then the element was not present 
+    return -1
+  
+  
+# Test array 
+arr = [ 2, 3, 4, 10, 40 ] 
+x = 10
+  
+# Function call 
+result = binary_search(arr, x) 
+  
+if result != -1: 
+    print("Element is present at index", str(result)) 
+else: 
+    print("Element is not present in array") 
