adding find minimum in rotated sorted array

Author: daiyongg-kim

find-minimum-in-rotated-sorted-array/daiyongg-kim.py

@@ -0,0 +1,14 @@
+class Solution:
+    def findMin(self, nums: List[int]) -> int:
+        #constraint complexity: O(log n)
+        left = 0
+        right = len(nums) - 1
+
+        while left < right:
+            mid = (left + right) // 2
+
+            if nums[mid] < nums[right]:
+                right = mid
+            else:
+                left = mid + 1
+        return nums[left]