JAVA |  Binary Search
\nclass Solution {\n    public int findMin(int[] nums) {\n        int n = nums.length;\n        int start = 0;\n        int end = n-1;\n        while(start<=end
```\nclass Solution {\n    public int findMin(int[] nums) {\n        int n = nums.length;\n        int start = 0;\n        int end = n-1;\n        while(start<=end){\n            int mid = start + (end-start)/2;\n            if(nums[mid]<nums[end]){\n                end = mid;\n            }else{\n                start = mid+1;\n            }\n        }\n        return nums[end];\n    }\n}\n```
['Binary Tree', 'Java']