First = 0, Last = 8 2nd Iteration -> First = 5, Last = 8 3rd Iteration -> First = 5, Last = 6 %3D O 1st Iteration -> First = 0, Last = 8 2nd Iteration -> First = 5, Last = 8 Brd Iteration -> First = 7, Last = 8 4th Iteration -> First = 8, Last = 8 O 1st Iteration -> First = 0, Last = 8 2nd Iteration -> First = 0, Last = 3 3rd Iteration -> First = 2, Last = 3 4th Iteration -> First = 3, Last = 3 O1st Iteration -> First = 0, Last = 8 2nd Iteration -> First = 0, Last 3 Brd Iteration -> First = 2, Last = 3 "/>
Extracted text: Binary Search algorithm uses the divide-and-conquer technique to find elements in O(logn) steps. Given the following sorted array that has 9 elements, what is the scope of the search (First index and last index of the array segment) in each iteration of the binary search algorithm while looking for the element "51"? Note: Numbers that show up in the first row are the array indexes 0. 1 3 4 6. 7 8. 9 12 19 21 30 32 37 44 51 1st Iteration -> First = 0, Last = 8 2nd Iteration -> First = 5, Last = 8 3rd Iteration -> First = 5, Last = 6 %3D O 1st Iteration -> First = 0, Last = 8 2nd Iteration -> First = 5, Last = 8 Brd Iteration -> First = 7, Last = 8 4th Iteration -> First = 8, Last = 8 O 1st Iteration -> First = 0, Last = 8 2nd Iteration -> First = 0, Last = 3 3rd Iteration -> First = 2, Last = 3 4th Iteration -> First = 3, Last = 3 O1st Iteration -> First = 0, Last = 8 2nd Iteration -> First = 0, Last 3 Brd Iteration -> First = 2, Last = 3