153. Find Minimum in Rotated Sorted Array
\n\n       int lo = 0, hi = nums.size() - 1; \n\t   int Mn = 1e5;\n        while (lo <= hi)\n        {\n            int m = lo + (hi - lo) / 2;\n\n            i
![image](https://assets.leetcode.com/users/images/e29110cd-d07c-4691-8e4b-7d457bd57413_1638089867.2077987.png)\n\n       int lo = 0, hi = nums.size() - 1; \n\t   int Mn = 1e5;\n        while (lo <= hi)\n        {\n            int m = lo + (hi - lo) / 2;\n\n            if(nums[0] > nums[nums.size()-1]){\n                if(nums[m] >= nums[0]){\n                    lo = m + 1;\n                }\n                else\n                {\n                    hi = m - 1;\n                }\n                Mn = min(Mn, nums[m]);\n            }\n            else\n            { // when array  is sorted in increasing order\n                return nums[0];\n            }\n        }\n\n        return Mn;\n    }
['Array', 'Binary Tree']