Question: .please answer these question except no30 234 Chapter 5 Algorithms 25. What letters are interrogated by the binary search (Figure 5.14) if it is applied
234 Chapter 5 Algorithms 25. What letters are interrogated by the binary search (Figure 5.14) if it is applied to the list AB, C, D, E, EG, H, I, J, K, L, M, N, O when searching for the value JY What about search ing for the value 29 26. After performing many sequential searches on a list of 6,000 entries, what would you expect to be the average number of times that the tar get value would have been compared to a list entry? What if the search algorithm was the binary search? 27. Identify the termination condition in each of the following iterative statements. a. while (Count b. repeat 3 until (Count = 1) while ((Count 0) then print the value of N and apply the procedure MysteryPrint to the value N - 2) Print the value of N + 1. 35. Apply the procedure MysteryPrint (defined below) to the value 2 and record the values that are printed procedure MysteryPrint (N) if (N> 0) then print the value of N and apply the procedure MysteryPrint to the value N - 2) else (print the value of N and 17 (N-1) then apply the procedure MysteryPrint to the value N. 1)) 36. Design an algorithm to generate the sequence of positive integers (in increasing order) whose only prime divisions are 2 and 3 that is your program should produce the sequence 2 3, 4, 6, 8, 9, 12, 16, 18, 24, 27, Does your program represent an algorithm in the strict sense
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
