## BJP4 Self-Check 13.22: binarySearch4

Language/Type: Java binary search searching
Author: Roy McElmurry (on 2016/09/08)

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  13
int[] numbers = {-30, -9, -6, -4, -2, -1,  0,  2,  4, 10, 12, 17, 22, 30};

// search for the value -5
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. Assume that we are using the binary search algorithm shown in lecture and section.

 `indexes examined` `value returned`

You must log in before you can solve this problem.

If you do not understand how to solve a problem or why your solution doesn't work, please contact your TA or instructor.
If something seems wrong with the site (errors, slow performance, incorrect problems/tests, etc.), please

Is there a problem? Contact a site administrator.