Merge pull request #24 from proPrateekSahu/main

Create BinarySearch

Author: Aishanipach

BinarySearch

@@ -0,0 +1,36 @@
+def binary_search(arr, x):
+	low = 0
+	high = len(arr) - 1
+	mid = 0
+
+	while low <= high:
+
+		mid = (high + low) // 2
+
+		
+		if arr[mid] < x:
+			low = mid + 1
+
+		
+		elif arr[mid] > x:
+			high = mid - 1
+
+		
+		else:
+			return mid
+
+	
+	return -1
+
+
+# Test array
+arr = [ 1, 10, 15, 20, 30 ]
+x = 20
+
+# 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")