diff --git a/Sorting_Searching/Binary_Search.py b/Sorting_Searching/Binary_Search.py
new file mode 100644
index 0000000..9c097fa
--- /dev/null
+++ b/Sorting_Searching/Binary_Search.py
@@ -0,0 +1,31 @@
+# Returns index of x in the list/array if present, else -1 
+def binarySearch(arr, l, r, x): 
+     
+    if r >= l: 
+        mid = l + (r - l) // 2
+
+        
+        if arr[mid] == x: 
+            return mid 
+        
+        
+        elif arr[mid] > x: 
+            return binarySearch(arr, l, mid-1, x) 
+
+
+        else: 
+            return binarySearch(arr, mid + 1, r, x) 
+
+    else:  
+        return -1
+
+if __name__ == '__main__': 
+    arr = [ 2, 4, 6, 8, 10] 
+    x = 10
+
+    result = binarySearch(arr, 0, len(arr)-1, x) 
+
+    if result != -1: 
+        print ("Element is present at index % d" % result) 
+    else: 
+        print ("Element is not present in array")