Adding Binary_search.py

Author: niNja2910

Binary_search.py

@@ -0,0 +1,35 @@
+def binary_search(arr, x):
+    low = 0
+    high = len(arr) - 1
+    mid = 0
+ 
+    while low <= high:
+ 
+        mid = (high + low) // 2
+ 
+        # If x is greater, ignore left half
+        if arr[mid] < x:
+            low = mid + 1
+ 
+        # If x is smaller, ignore right half
+        elif arr[mid] > x:
+            high = mid - 1
+ 
+        # means x is present at mid
+        else:
+            return mid
+ 
+    # If we reach here, then the element was not present
+    return -1
+ 
+
+
+#__main()__
+L=list(map(int,input().split()))
+p=int(input())
+L.sort()
+P=binary_search(L,p)
+if(P==-1):
+    print("Not found")
+else:
+    print("Position of element found: ",P)