Algorithms quiz

Test your Algorithms knowledge with a free interactive quiz — 50 questions with answers and explanations. No signup needed to play.

The time-vs-space tradeoff means:

1. The time-vs-space tradeoff means:
2. Binary search has what time complexity, and what is its precondition?
3. What does it mean for a sorting algorithm to be "stable"?
4. A recursive algorithm requires what to terminate?
5. What is the time complexity of linear search on an unsorted array of n elements?
6. Which sort has best-case O(n) when the array is already sorted, while still being a simple comparison sort?
7. What is the difference between best-case, average-case, and worst-case complexity?
8. Counting sort is a non-comparison-based sort that runs in O(n + k), where k is:
9. Quicksort's average vs worst-case time complexity is:
10. What is a "tradeoff" you typically make when picking quicksort over merge sort for general-purpose sorting?
11. What is the worst-case time complexity of bubble sort?
12. What does "in-place" mean for an algorithm?

More quizzes