Algorithms quiz

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

What is a "tradeoff" you typically make when picking quicksort over merge sort for general-purpose sorting?

1. What is a "tradeoff" you typically make when picking quicksort over merge sort for general-purpose sorting?
2. Which sort has best-case O(n) when the array is already sorted, while still being a simple comparison sort?
3. Using a hash set/map to speed up lookups changes a "find pair" loop's complexity from:
4. Two algorithms both have time complexity `O(n)`. Which statement is most useful in practice?
5. Divide and conquer is an algorithmic paradigm that:
6. What does "in-place" mean for an algorithm?
7. Counting sort is a non-comparison-based sort that runs in O(n + k), where k is:
8. What is an algorithm?
9. Merge sort has what time complexity, and what extra space does it typically use?
10. What is the difference between best-case, average-case, and worst-case complexity?
11. Brute force is best described as:
12. What does it mean for a sorting algorithm to be "stable"?

More quizzes