Algorithm Design with Haskell

"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"-- Provided by publisher Cover 1 Frontmatter 2 Dedication 6 Contents 8 Preface 14 Basics 18 Functional programming 22 Timing 42 Useful data structures 60 Divide and Conquer 76 Binary search 80 Sorting 110 Selection 138 Greedy Algorithms 158 Greedy algorithms on lists 162 Greedy algorithms on trees 194 Greedy algorithms on graphs 222 Thinning Algorithms 254 Introduction to thinning 258 Segments and subsequences 284 Partitions 306 Dynamic Programming 326 Efficient recursions 330 Optimum bracketing 352 Exhaustive Search 382 Ways of searching 386 Heuristic search 422 Index 449 This book presents the five main principles of algorithm design: divide and conquer, greedy algorithms, thinning, dynamic programming, and exhaustive search. It serves students, teachers, researchers, 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.