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)
Source: GeeksforGeeks
https://www.geeksforgeeks.org/gate-gate-mock-2017-question-12/
I did not understand this as best case time should be O(n) sorting method what does highest best cases mean?