GATE Computer Science (CS) 2016 Shift 1 Solved Paper

© examsiri.com

Question : 23 of 65

Marks: +1, -0

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

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

Go to Question:

Prev Question

Next Question