📚 Practice Mode

Computer Science Theory

Learn at your own pace with hints and detailed explanations

1 / 15
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