FindMin

//Follow up for "Find Minimum in Rotated Sorted Array":
//What if duplicates are allowed?
//
//Would this affect the run-time complexity? How and why?
//Suppose a sorted array is rotated at some pivot unknown to you beforehand.
//
//(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).
//
//Find the minimum element.
//
//The array may contain duplicates.


public class FindMin {
    public int findMin(int[] num) {
        
        if(num.length==1){
            return num[0];
        }
        int min=num[0];
        int i;
        for(i=0;i             if(min>num[i])
              break;
            min=num[i];
            
        }
        if(i             return num[i];
        else    
            return num[0]; 
    }
}