1.

Suppose P, Q, R, S, T are sorted sequences having lengths 20, 24, 30, 35, 50 respectively. They are to be merged into a single sequence by merging together two sequences at a time. The number of comparisons that will be needed in the worst case by the optimal algorithm for doing this is ____.(A) 358(B) 438(C) 568(D) 664

Answer»


Discussion

No Comment Found

Related InterviewSolutions