generated at
『Algorithm Design with Haskell』

2020/7/9
400ページぐらいあるらしい


勉強会



**Part I. Basics:**
1. Functional programming
2. Timing
3. Useful data structures

**Part II. Divide and Conquer:**
4. Binary search
5. Sorting
6. Selection

**Part III. Greedy Algorithms:**
7. Greedy algorithms on lists
8. Greedy algorithms on trees
9. Greedy algorithms on graphs

**Part IV. Thinning Algorithms:**
10. Introduction to thinning
11. Segments and subsequences
12. Partitions

**Part V. Dynamic Programming:**
13. Efficient recursions
14. Optimum bracketing

**Part VI. Exhaustive Search:**
15. Ways of searching
16. Heuristic search

**Index.**