Algorithms & Data Structures
The core toolkit — and the difference between a program that finishes and one that does not.
14 topics · 1 curated work
Topics
- 01Asymptotic Analysis
- 02Sorting & Searching
- 03Arrays, Lists & Hash Tables
- 04Trees & Balanced Search Trees
- 05Heaps & Priority Queues
- 06Graph Algorithms
- 07Dynamic Programming
- 08Greedy Algorithms
- 09Divide & Conquer
- 10String Algorithms
- 11Randomised Algorithms
- 12Approximation Algorithms
- 13Online & Streaming Algorithms
- 14Amortised Analysis
Curated reading
1Go deeper
Primary sources and full treatments.
- BookIntroduction to AlgorithmsCormen, Leiserson, Rivest & Stein, 1990
The reference: every standard algorithm with its correctness argument and cost, which is what separates knowing one from being able to choose one.