Algorithms Explained
yourbasic.org/algorithms
Code should be correct, clear and efficient.
Prefer simple. Avoid clever.
Algorithms
- LLMs: Algorithms that break the rules
- Algorithms: What’s the problem?
- Introduction to graph algorithms: definitions and examples
- Dynamic programming [step-by-step example]
- Las Vegas vs. Monte Carlo algorithms
- Blackjack card counting risk analysis: poor gains at huge risk
- What’s a seed in a random number generator?
- Generate all permutations
Data structures
- Time complexity of array/list operations [Java, Python]
- Hash tables explained [step-by-step example]
- How to avoid initializing memory [in theory]
- Binary search trees explained
- Treaps: Randomized search trees
- Bloom filters explained
Sorting
Correctness
- Loop invariants can give you coding superpowers
- On induction and recursive functions, with an application to binary search
Analysis
- How to analyze time complexity: Count your steps
- Big O notation: definition and examples
- The quadratic wall: Why LLM context windows are expensive
- Time complexity of recursive functions [Master theorem]
- Unit cost vs. bit cost in time complexity
- Amortized time complexity
Software engineering
