Which sorting algorithm has the best average-case time complexity?

Practice Questions

1 question
Q1
Which sorting algorithm has the best average-case time complexity?
  1. Bubble Sort
  2. Insertion Sort
  3. Merge Sort
  4. Selection Sort

Questions & Step-by-step Solutions

1 item
Q
Q: Which sorting algorithm has the best average-case time complexity?
Solution: Merge Sort has an average-case time complexity of O(n log n), which is better than the average-case complexities of the other options.
Steps: 0

Related Questions

Soulshift Feedback ×

On a scale of 0–10, how likely are you to recommend The Soulshift Academy?

Not likely Very likely