Question: 2. Consider the following sorted array. Search for the key = 90 by applying the Binary Search algorithm. Clearly indicate the low, high and the

2. Consider the following sorted array. Search for the key = 90 by applying the Binary Search algorithm. Clearly indicate the low, high and the mid index in each iteration of the Binary Search and show how the mid index is evaluated. How many comparisons are done before finding the key? What is the maximum number of comparison a Binary Search will do on an input of size n? 0 1 2 3 4 5 6 7 8 6 12 17 23 38 45 77 84 90
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
