Given an array arr = {45,77,89,90,94,99,100} and key = 100; What are the mid values(corresponding array elements) generated in the first and second iterations?

The question is about the Binary Search algorithm. In Binary Search, we start with the middle element and compare it with the key. If the key is equal to the middle element, we return the index. If the key is less than the middle element, we repeat the process with the left half of the array. If the key is greater than the middle element, we repeat the process with the right half of the array.

Here is the step by step process for the given array and key:

Array: {45,77,89,90,94,99,100} Key: 100

First Iteration:

• Start = 0, End = 6 (Array indices)
• Mid = (Start + End) / 2 = (0 + 6) / 2 = 3
• Mid element = arr[3] = 90

Second Iteration:

• Since the key is greater than the mid element, we update start to mid + 1.
• Start = 3 + 1 = 4, End = 6
• Mid = (Start + End) / 2 = (4 + 6) / 2 = 5
• Mid element = arr[5] = 99

So, the mid values (corresponding array elements) generated in the first and second iterations are 90 and 99 respectively.