Gate CS-2016-1 Question Paper With Solutions

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

(A) Θ(n log n), Θ(n log n) and Θ(n²)

(B) Θ(n²), Θ(n²) and Θ(n Log n)

(C) Θ(n²), Θ(n log n) and Θ(n log n)

(D) Θ(n²), Θ(n log n) and Θ(n²)

Answer: (D)

Explanation: