Beginner Data Structures & Algorithms
Q15 / 100

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

Correct! Well done.

Incorrect.

The correct answer is C) Merge Sort — O(n log n)

C

Correct Answer

Merge Sort — O(n log n)

Explanation

Merge sort achieves O(n log n) in all cases (best, average, worst). Quicksort also averages O(n log n) but has O(n²) worst case.

Previous All Questions Next
Progress
15/100
🌳

Browse All Data Structures & Algorithms Questions

100 questions · beginner to advanced