GATE | GATE MOCK 2017 | Question 12
Which of the below given sorting techniques has highest best-case runtime complexity.
(A) Quick sort
(B) Selection sort
(C) Insertion sort
(D) Bubble sort
Answer: (B)
Explanation:
Quick sort best case time complexity is Ο(n logn)
Selection sort best case time complexity is Ο(n^2 )
Insertion sort best case time complexity is Ο(n)
Bubble sort best case time complexity is Ο(n)
Quiz of this Question
Last Updated :
28 Jun, 2021
Like Article
Save Article
Share your thoughts in the comments
Please Login to comment...