Computer Science Theory

Casual Mode - Take your time!

1 / 15
✓
Correct
0
✗
Incorrect
0
★
Score
0%
Multiple Choice

Which sorting algorithm has a worst-case time complexity of O(n^2) but a best-case time complexity of O(n)?

  1. Bubble Sort
  2. Merge Sort
  3. Quick Sort
  4. Heap Sort
Change Mode