Complexity learning map

How the concepts connect

The Obsidian canvases distinguish time and memory for each growth class. Each class now has one comprehensive guide with separate sections for both measures:

Class	Time analysis	Space analysis
O(1)	Time example	Space example
O(log n)	Time example	Space example
O(√n)	Time example	Space example
O(n)	Time example	Space example
O(n log n)	Time example	Space example
O(n²)	Time example	Space example
O(n³)	Time example	Space example
O(2ⁿ)	Time example	Space example
O(n!)	Time example	Space example

Suggested learning order

1. Understand Big O
2. Time complexity
3. Space complexity
4. Compare the curves

More advanced expressions

Polylogarithmic memory O((log n)^c) can arise when a fixed number of logarithmic-size structures are combined. Polynomial memory O(n^c) names a family rather than one specific class; O(n²) and O(n³) are examples.