Skip to content
Related Articles

Related Articles

GATE | GATE-CS-2007 | Question 14

Improve Article
Save Article
  • Last Updated : 28 Jun, 2021
Improve Article
Save Article

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
Related Articles

Start Your Coding Journey Now!