4. Consider the following list: Index 01234567 Number 23 2 19 3 7 11 5 13...

   

Transcribed Image Text:

4. Consider the following list: Index 01234567 Number 23 2 19 3 7 11 5 13 Will the algorithm given on the right be able to find the search value T-2 for the list above? If yes, show the value of L, R, m in each step of the algorithm. If no, explain why not. function binary_search(A, n, T) is L := 0 R = n 1 while LR do m = floor((LR) / 2) if A[m] T then L := m + 1 else if A[m] > T then R = m - 1 else: return m return unsuccessful Here, A denotes the list, and n denotes its size. 4. Consider the following list: Index 01234567 Number 23 2 19 3 7 11 5 13 Will the algorithm given on the right be able to find the search value T-2 for the list above? If yes, show the value of L, R, m in each step of the algorithm. If no, explain why not. function binary_search(A, n, T) is L := 0 R = n 1 while LR do m = floor((LR) / 2) if A[m] T then L := m + 1 else if A[m] > T then R = m - 1 else: return m return unsuccessful Here, A denotes the list, and n denotes its size.

Answer rating: 100% (QA)

To determine whether the given algorithm will be able to find the search value T2 in the provided li... View the full answer