Answered step by step
Verified Expert Solution
Question
1 Approved Answer
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 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: |
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started