JAVA Binary Search Easy-to-understand|| faster than 100%
Solution  1:\n\nclass Solution {\n    public int findMin(int[] nums) {\n         int low = 0;\n        int high = nums.length-1;\n       \n        while(low < h
**Solution  1:**\n```\nclass Solution {\n    public int findMin(int[] nums) {\n         int low = 0;\n        int high = nums.length-1;\n       \n        while(low < high){\n          \n          int mid = low + (high-low) / 2;\n          if(nums[mid] < nums[high])\n              high = mid;\n          else  \n              low = mid+1;\n        \n        }\n      return nums[low];\n    }\n}\n```\n\n**Solution 2 :**\n\n```\nclass Solution {\n    public int findMin(int[] nums) {\n        int low=0;\n        int high=nums.length-1;\n        while(low < high)\n       {\n            int mid = low + (high - low) / 2;\n            if (nums[mid] ==nums[high])\n                high--;\n\n            else if(nums[mid] > nums[high])\n                low = mid + 1;\n            else\n                high = mid;\n         }\n        return nums[high];\n    }\n}\n```
['Binary Tree', 'Java']