Practice: Algorithm Analysis Foundations

Content locked

The catalog is public. Reading this content requires approved access.

1. Compare growth [Warm-up]

2. What does an upper bound say? [Explain]

3. Solve recurrences [Core]

4. Count states and work [DP prerequisite]

5. Nearly sorted does not mean quadratic [Trace]

6. Sort bounded integers [Design]

7. Outputs versus inputs [Lower bound]

8. Information with one unreliable answer [Stretch]