what are the array elements corresponding to the mid-avlues in the first and second iterations of a binary search in an array arr

The answer is "90-99".

Explanation:

Please find the complete question in the attachment file.

The binary search array in up or downward order would be scanned. The array given is now in upward order. Thus it is going to look for both the middle. If the core aspect of the range will be less than the key, it is moved to the second half of the array in the next version.

Unless the middle part is smaller than that of the key, it will move to the first half in the next iterations. If another central element of an array matches the key, the index would be returned. The middle value is ar[0+6/2] = ar[3] = 90 on first step of iterations. 0 is the initial index and 6 is the final range index.

The first iteration's mid-value is 90. As 90 is under 99, you're searching for the second half of the array over the next iteration. The mean meaning in the second stage is arr[4+6/2] = arr[5] = 99, and  4 was its second-half first index and 6 is the array's last index. The second iteration mid-value is 99.

ok i will be on the look out for blahblahthisisfakeah

answer; peter zenger;