Question

2. The following (adapted from Wikipedia) gives pseudocode for searching a sorted vector A for a specific element T. Given an array A of n elements with values or records A1 An and target value T, the following subroutine uses binary search to find the index of T in A. 1. Set L to 1 and R ton. 2. If L>R, the search terminates as unsuccessful Set m (the position of the middle element) to the floor of (L+R)/2. 3. If A m < T, set L to m+1 and go to step 2. 4. If Am > T, set R to m-1 and go to step 2. 5. If A m = T, the search is done; return m. a. What is the input of this function? What is its output? b. How many values of Am are computed for the inputs A [3, 10. 11. 19, 31, 40, 50, 100] and T = 1 1? List each of them, in order. (Hint. Next week you will have to implement a function in Matlab using this pseudocode, so consider already doing that now.) c. Give an example of a length three vector A (not necessarily sorted) and a target element T for which the above procedure does not return the correct answer. Explain your answer

Answer 1

Answer 2 al Trhutsラ(t) Number et elements in the army-. Nete: I LR,if he seaxch ts uncuccess the relurnSearh is un suecessut 皿 に[310 e 19 first cycleウ に1 , Rzns8 4, 51-5 >11 A-5-31 今 Second Cycle Cifertien) > ms3t> Therefore,

'Therefore, two values 부 A-m were calculated d) Am,= A5-31-7 Ans.fb) [O] -Thi 5 トart tricky , but easy. Take an unsorted arehyef elements As[30 20 1 Fitst iteration R-3 L=1 , Therefore, m-1 R= = Second Iteration → 17R 0 . Terdere, search Therefore, ,Rz0ウ1