Divide and Conquer
Q1.
The minimum number of comparisons required to find the minimum and the maximum of 100 numbers is _________________.Q2.
If n is a power of 2, then the minimum number of multiplications needed to compute a^n isQ3.
Given below are some algorithms, and some algorithm design paradigms. Match the above algorithms on the left to the corresponding design paradigm they follow.Q5.
Consider a sequence of 14 elements: A = [-5, -10, 6, 3, -1, -2, 13, 4, -9, -1, 4, 12, -3, 0]. The subsequence sum S(i,j)=\sum_{k=i}^{j}A[k]. Determine the maximum of S(i,j), where 0 \leq i \leq j \lt 14. (Divide and conquer approach may be used). Answer:______