//Search an elemnet in rotated sorted array

1. First we will calculate the mid element
2. Then check wheather arr[mid]>arr[start]
3. if above condition satisfied we can we find k is there or not
between arr[strat] and arr[mid]

3.then check for other part
=======================================================


if(arr[mid]>arr[mid+1])
  return arr[mid+1]

if(arr[mid]<arr[mid-1])
  return arr[mid]

=======================================
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[mid-1]){ //26<12
                return arr[mid];
            }
            if(mid!=arr.length-1 && arr[mid+1]<arr[mid]){//38<26
                return arr[mid+1];
            }
            
            if(arr[mid]>arr[start]){
                start=mid+1;
            }else{
                end=mid-1;
            }
        }
        return -1;
    }
}