Question: Suppose we are performing a binary search on a sorted array called numbers initialized as follows: // index: 0 1 2 3 4 5 6

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

// index: 0 1 2 3 4 5 6 7 8 9 10 11 12 int[] numbers = {-5, -1, 3, 5, 7, 10, 18, 29, 37, 42, 58, 63, 94}; // search for the value 33 int index = binarySearch(numbers, 33); 

Why is the value return not 37? Even if index 8 was 33 it still wouldn't have been 33.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!