CareerCup

This is working code.
Please check it and give any comment if you have.

int binarySearchOnCircularArray(int arr[], int arrSize, int key)
{
    int mid, start=0, end1=arrSize-1;
    int index=-1;
    if(arr[start] == key)
        index = start;
    else if(arr[end1] == key)
        index = end1;

    while(index == -1 && start != end1 -1)
    {
        mid = (start+end1)/2;
        if(arr[mid] == key)     //If found the element
            index = mid;
        else if (arr[mid] < arr[start]) //Right part of mid is sorted array...
        {
            if(key > arr[mid] && key < arr[end1])
                start = mid;
            else
                end1 = mid;
        }
        else    //Left part of mid is sorted array....
        {
            if(key > arr[start] && key < arr[mid])
                end1 = mid;
            else
                start = mid;
        }
    }

    return index;
}

This one is often asked / talked about:

blogs.msdn.com/b/bali_msft/archive/2009/02/03/search-for-a-number-in-shifted-sort-array-within-o-log-n-time.aspx

def searchB(arr, start, end, key):
length = len(arr)-1
if start>end:
end = length+end
while(start<end):
mid = (start+end)/2
if key == arr[start%length]:
return start%length
elif key == arr[end%length]:
return end%length
elif key == arr[mid%length]:
return mid%length
elif key>arr[mid%length]:
start = mid+1
else:
end = mid
return -1

public class CircularBinSearch {
	
	
	private int[] arr;
	private int offset;


	public CircularBinSearch(int[] arr, int offset){
		this.arr = arr;
		this.offset = offset;
	}
	
	private int getValue(int index){
		return this.arr[getWithOffset(index)];
	}

	private int getWithOffset(int index) {
		return (index+offset)%this.arr.length;
	}
	
	
	public int search(int value){
		int l = 0;
		int r = arr.length;
		int result = -1;
		while(l<r){
			int center = (l+r)/2;
			int currValue = getValue(center);
			if(currValue == value){
				l = center;
				break;
			}
			if(currValue<value){
				l = center+1;
			}else{
				r = center - 1;
			}
		}
		
		if(value == getValue(l)){
			result = l;
		}
		return getWithOffset(result);
	}
	
}