Find Minimum in Rotated Sorted Array - LeetCode

Problem Link C++ Code class Solution { public: int findMin(vector<int>& nums) { int low = 0; int high = nums.size() - 1; int ans = INT_MAX; while(low <= high) { int mid = low + (high-low)/2; ...