Book Content
chapters • 11h20m total length
1. Why bother? - The Basics
2. Cogs and Pulleys – Building blocks
3. Protocols - Basic abstract data types
4. Detour - Functional Programming
5. Efficient Searching - Binary Search and Sorting
6. Efficient Sorting - Quicksort and Merge Sort
7. Concepts of Tree
8. More about search – Search trees and hash-tables
9. Concepts of Tree
10. Concepts of Graph
11. Reactive Programming














