Circular Binary Search - Search an element in array which is first increasing then decreasing then increasing or other way round

https://github.com/mission-peace/interview/blob/master/src/com/interview/binarysearch/CircularBinarySearch.java
Given a circle with N defined points and a point M outside the circle, find the point that is closest to M among the set of N. O(LogN)
http://www.careercup.com/question?id=4877486110277632
 * 1) smallest element at center
 * 2) smallest element at left/right end
 * 3) largest element at center
 * 4) smallest element at left side
 * 5) smallest element at right side
    //if mid is greater than both ends than result is low of two ends else move in direction
    //where either mid-1 or mid+1 is less
    public int search(int arr[]) {
        int low = 0;
        int high = arr.length - 1;
        int mid = 0;
        while (low < high) {
            mid = (low + high) / 2;
            //if middle is less than both mid-1 and mid+1 then mid is the answer
            if((low == mid || arr[mid] < arr[mid-1])&& arr[mid] < arr[mid+1]){
                return arr[mid];
            }
            if ((arr[mid] >= arr[low] && arr[mid] >= arr[high])){
                if(arr[low] < arr[high]){
                    high = mid-1;
                }else{
                    low = mid+1;
                }
            }else{
                if(arr[mid-1] < arr[mid+1]){
                    high = mid-1;
                }else{
                    low = mid+1;
                }
            }
        }
        return arr[low];
    }