Implement binary search to find minimum in rotated array (#1077)

Author: Chayandas07

153. Find Minimum in Rotated Sorted Array 1

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