Gate CS-2007 Question Paper With Solutions

Q. 3 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:

Gate CS-2007 Question Paper With Solutions

Learn More:   Gate EE-2016-1 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here