logo CodeStepByStep logo

Main Page → Exercises → Java → Solve an Exercise

binarySearch2

Language/Type: Java binary search searching
Related Links:

Suppose we are performing a binary search on a sorted array initialized as follows: 

// index          0   1   2   3   4   5   6   7   8   9  10  11  12  13
int[] numbers = {-2,  0,  1,  7,  9, 16, 19, 28, 31, 40, 52, 68, 85, 99};
int index = binarySearch(numbers, 5);

Write the indexes of the elements that would be examined by the binary search (the mid values in our algorithm's code) and write the value that would be returned from the search.

indexes examined
value returned

You must log in before you can solve this problem.

Log In

Need help?

Stuck on an exercise? Contact your TA or instructor.

If something seems wrong with our site, please

Is there a problem? Contact us.