0
/ 50

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...

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 feedback will appear here when you check your answer.