Algorithm Design with Haskell
Cambridge University Press, 7/9/2020
EAN 9781108491617, ISBN10: 1108491618
Hardcover, 450 pages, 25.1 x 17.8 x 2.8 cm
Language: English
Originally published in English
This book is devoted to five main principles of algorithm design: divide and conquer, greedy algorithms, thinning, dynamic programming, and exhaustive search. These principles are presented using Haskell, a purely functional language, leading to simpler explanations and shorter programs than would be obtained with imperative languages. Carefully selected examples, both new and standard, reveal the commonalities and highlight the differences between algorithms. The algorithm developments use equational reasoning where applicable, clarifying the applicability conditions and correctness arguments. Every chapter concludes with exercises (nearly 300 in total), each with complete answers, allowing the reader to consolidate their understanding and apply the techniques to a range of problems. The book serves students (both undergraduate and postgraduate), researchers, teachers, and professionals who want to know more about what goes into a good algorithm and how such algorithms can be expressed in purely functional terms.
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.