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/

Quiz of this Question



My Personal Notes arrow_drop_up


Article Tags :

Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.