Find Minimum In Rotated Sorted Array solution

Author: PDKhan

find-minimum-in-rotated-sorted-array/PDKhan.cpp

@@ -0,0 +1,18 @@
+class Solution {
+    public:
+        int findMin(vector<int>& nums) {
+            int left = 0;
+            int right = nums.size() - 1;
+    
+            while(left < right){
+                int mid = (left + right) / 2;
+    
+                if(nums[mid] > nums[right])
+                    left = mid + 1;
+                else
+                    right = mid;
+            }
+    
+            return nums[left];
+        }
+    };