The worst case running times of Insertion sort, Merge sort and Quick sort,…

PYQ GATE 2016

The worst case running times of Insertion sort, Merge sort and Quick sort, respectively, are:

  1. A.

    Θ(n log n), Θ(n log n) and Θ(n2)

  2. B.

    Θ(n2), Θ(n2) and Θ(n Log n)

  3. C.

    Θ(n2), Θ(n log n) and Θ(n log n)

  4. D.

    Θ(n2), Θ(n log n) and Θ(n2)

Attempted by 758 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…