Suppose P, Q, R, S, T are sorted sequences having lengths 20, 24, 30, 35, 50…

PYQ Wipro NLTH / Elite 2024

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 ____.

  1. A.

    500

  2. B.

    358

  3. C.

    450

  4. D.

    259

Attempted by 46 students.

Sign up free to check your answer

Sign up free

Explore the full course: Cdac C Cat Complete Preparation

Loading lesson…