_33_search_rotated_array.java

public class _33_search_rotated_array {
    private int binarySearch(int[] nums, int target, int start, int end){
        if(start>end){
            return -1;
        }
        int mid = (start + end) / 2;
        if (nums[mid] == target) {
            return mid;
            }
        if(nums[mid] < nums[end]){
            if(nums[mid] < target && target <= nums[end]){
                return binarySearch(nums, target, mid +1 , end);
            }
            else{
                return binarySearch(nums, target, start, mid-1);
            }
        }

        else{
            if(nums[start] <= target && target < nums[mid]){
                return binarySearch(nums, target, start, mid-1);
            }
            else{
                return binarySearch(nums, target, mid + 1, end);
            }
        }
    }


    public int search(int[] nums, int target) {
        int start = 0;
        int end = nums.length-1;
        return binarySearch(nums, target, start, end);
    }
}