Book Content
chapters • 10h36m total length
1. Why Functional Programming
2. Building Blocks
3. Lists
4. Binary Trees
5. More List Algorithms
6. Graph Algorithms
7. Random Access Lists
8. Queues
9. Streams, Laziness and Algorithms
10. Being Lazy - Queues and Deques
11. Red-Black Trees
12. Binomial Heaps
13. Sorting
