CS 530 Advanced Algorithm Design and Analysis

(a) Given m vectors each of size n, use divide-and-conquer strategy to write a . recursive. algorithm RMIN which determines the minimum vector. (b) Let T(m) denote the number of key comparisons RMIN needs to find the minimum vector among m vectors. Define and solve the recurrence relation of T(m) in terms of m and n. 4. ................
................