Added binary search in python (#282)

Author: rahmat-dev

Python/binary_search.py

@@ -0,0 +1,25 @@
+class Solution:
+    def search(self, nums: List[int], target: int) -> int:
+        low = 0
+        high = len(nums) - 1
+        mid = 0
+
+        while low <= high:
+
+            mid = (high + low) // 2
+
+            # If x is greater, ignore left half
+            if nums[mid] < target:
+                low = mid + 1
+
+            # If x is smaller, ignore right half
+            elif nums[mid] > target:
+                high = mid - 1
+
+            # means x is present at mid
+            else:
+                return mid
+
+        # If we reach here, then the element was not present
+        return -1
+