X477: Binary Search 2

Below is an implementation of binary search on a list of objects of type T. In this case, you can assume that T will always extend Comparable and that if you ran x.compareTo(y) and got -1, then x<y.

Fill in the remaining lines to complete the method. You can always assume that T ray[] will be an array sorted from smallest to largest value.

Your Answer:

Answer code

public int binarySearch2(T ray[], T target, int first, int last) {
    if (first > last) {
        return -1;
    }
    else {
        int mid = (first + last) / 2;
        if (//Add Conditional Here!) {
            return mid;
        }
        if ( //Add Conditional Here!  ) {
            return binarySearch2(ray, target, mid + 1, last);
        }
        else {
            //Add return statement here!
        }
    } // end else
}
}// end BSH

​x
 
public int binarySearch2(T ray[], T target, int first, int last) {
    if (first > last) {
        return -1;
    }
    else {
        int mid = (first + last) / 2;
        if (//Add Conditional Here!) {
            return mid;
        }
        if ( //Add Conditional Here!  ) {
            return binarySearch2(ray, target, mid + 1, last);
        }
        else {
            //Add return statement here!
        }
    } // end else
}
}// end BSH
​

Reset

Practice a different Java exercise

Feedback

Your feedback will appear here when you check your answer.