completed binary-search1

search2Dmatrix.py

@@ -0,0 +1,22 @@
+# Time Complexity: O(log m*n)
+# Space Complexity: O(1)
+class Solution:
+    def searchMatrix(self, matrix: List[List[int]], target: int) -> bool:
+        m = len(matrix)
+        n = len(matrix[0])
+        low = 0
+        high = m * n - 1
+
+        while low <= high:
+            mid = low + ((high - low) // 2)
+            r = mid // n
+            c = mid % n
+
+            if matrix[r][c] == target:
+                return True
+            elif matrix[r][c] > target:
+                high = mid - 1
+            else:
+                low = mid + 1
+        return False
+

searchrotatedsortedarray.py

@@ -0,0 +1,25 @@
+# Time Complexity: O(logn)
+# Space Complexity: O(1)
+class Solution:
+    def search(self, nums: List[int], target: int) -> int:
+        low = 0
+        high = len(nums) - 1
+
+        while low <= high:
+            mid = low + ((high - low) // 2)
+            if nums[mid] == target:
+                return mid
+
+            elif nums[mid] > target:
+                if nums[low] <= target < nums[mid]:
+                    high = mid - 1
+                else:
+                    low = mid + 1
+
+            else:
+                if nums[mid] < target <= nums[high]:
+                    low = mid + 1
+                else:
+                    high = mid - 1
+        return -1
+