Skip to content
Related Articles

Related Articles

Improve Article

GATE | GATE-CS-2007 | Question 14

  • Last Updated : 28 Jun, 2021

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

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.

My Personal Notes arrow_drop_up
Recommended Articles
Page :