Suppose P, Q, R, S, T are sorted sequences having lengths 20, 24, 30, 35, 50…
GATE · 2014 · CS · Set 2 · Computer Science & IT
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 ____.
Attempted by 208 students.
Sign up free to check your answer
Sign up freeLoading lesson…