Which of the following sorting algorithms has the lowest worst-case complexity?

PYQ GATE 2007

Which of the following sorting algorithms has the lowest worst-case complexity?

  1. A.

    Merge sort

  2. B.

    Bubble Sort

  3. C.

    Quick Sort

  4. D.

    Selection Sort

Attempted by 1091 students.

Sign up free to check your answer

Sign up free

Explore the full course: Algorithms

Loading lesson…