GATE | GATE-CS-2007 | Question 14

Which of the following sorting algorithms has the lowest worst-case complexity?
(A) Merge sort
(B) Bubble Sort
(C) Quick Sort
(D) Selection Sort

Answer: (A)
Explanation: See Question 3 of https://www.geeksforgeeks.org/data-structures-and-algorithms-set-10/amp/
Quiz of this Question