// User function Template for Java class Solution { public int findMin(int[] arr) { // complete the function here int start=0; int end=arr.length-1; if(arr[start]<=arr[end]){ return arr[start]; } while(start<=end){ int mid=start+(end-start)/2; if(mid!=0 && arr[mid]arr[start]){ start=mid+1; }else{ end=mid-1; } } return -1; } } //71 12 26 38 47 69 // s=0 // end=5 // mid=2