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
Explanation: See Question 3 of https://www.geeksforgeeks.org/data-structures-and-algorithms-set-10/
Quiz of this Question
Attention reader! Don’t stop learning now. Practice GATE exam well before the actual exam with the subject-wise and overall quizzes available in GATE Test Series Course.
Learn all GATE CS concepts with Free Live Classes on our youtube channel.