Which of the below given sorting techniques has highest best-case runtime…
2023
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
Attempted by 247 students.
Show answer & explanation
Correct answer: B
Answer : B
Explanation
Among the given sorting techniques, selection sort has a best-case time complexity of O(n²), which is the highest. Quick sort, insertion sort, and bubble sort all have better best-case complexities (O(n log n), O(n), and O(n) respectively).