Following algorithm(s) can be used to sort n integers in the range [1...n³] in…

PYQ GATE 1992

Following algorithm(s) can be used to sort n integers in the range [1...n³] in O (n) time

  1. A.

    Heapsort

  2. B.

    Quicksort

  3. C.

    Mergesort

  4. D.

    Radixsort

Attempted by 120 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…