Which of the following sorting algorithms has the worst time complexity of n…

2018

Which of the following sorting algorithms has the worst time complexity of n log(n)?

Answer: A. Heapsort

  1. A.

    Heapsort

  2. B.

    Quicksort

  3. C.

    Insertion sort

  4. D.

    Selection sort

Attempted by 554 students.

Show answer & explanation

Correct answer: A

Explore the full course: Mppsc Assistant Professor Computer Science Paper 2

Loading lesson…