Question: Question 1 2 pts Suppose we are performing a binary search on a sorted array called numbers initialized as follows: // index 0 1 2
Question 1 2 pts Suppose we are performing a binary search on a sorted array called numbers initialized as follows: // index 0 1 2 3 4 5 8 9 10 11 12 Int[] numbers (-12,-10, 4, 7, 9, 13, 19, 22, 38, 45, 53, 77, 94); 1/ search for the value 9 in the numbers array (size 13) Write the indexes of the elements that would be examined by the binary search during each round and write the value that would be returned from the search. Round1: Min - 0, Max - 12. Mid - 6 Round2: Min- Max - Mid- Round3: Min- Max - Mid
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
