Other available formats:
Looking for an examination copy?
If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact firstname.lastname@example.org providing details of the course you are teaching.
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.Read more
- Emphasises the deep structure of algorithms, giving both new and standard examples, and illuminates commonalities and differences between apparently unrelated algorithms
- Contains nearly 300 exercises with complete answers, making the book suitable for use in the classroom or for self-study
- All the algorithms are implemented in Haskell, making this an ideal follow-on from Bird's Thinking Functionally with Haskell
Reviews & endorsements
‘I strongly suspect that Richard Bird hides a magically productive book writing apparatus in his office. This time around, Bird pulled the machine’s levers together with Jeremy Gibbons and out came Algorithm Design with Haskell, a book that is remarkable in many ways … the authors recast a number of classical problems in terms of thinning, including ones like knapsack which otherwise have been tackled via dynamic programming for ages. These fresh – very confidently and competently presented- takes on established material are true highlights of the text.’ Torsten Grust, Journal of Functional Programming
Not yet reviewed
Be the first to review
Review was not posted due to profanity×
- Date Published: August 2020
- format: Hardback
- isbn: 9781108491617
- length: 450 pages
- dimensions: 252 x 178 x 29 mm
- weight: 0.93kg
- contains: 28 b/w illus. 290 exercises
- availability: Available
Table of Contents
Part I. Basics:
1. Functional programming
3. Useful data structures
Part II. Divide and conquer:
4. Binary search
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
Part V. Dynamic programming:
13. Efficient recursions
14. Optimum bracketing
Part VI. Exhaustive search:
15. Ways of searching
16. Heuristic search
Find resources associated with this titleYour search for '' returned .
Type Name Unlocked * Format Size
This title is supported by one or more locked resources. Access to locked resources is granted exclusively by Cambridge University Press to instructors whose faculty status has been verified. To gain access to locked resources, instructors should sign in to or register for a Cambridge user account.
Please use locked resources responsibly and exercise your professional discretion when choosing how you share these materials with your students. Other instructors may wish to use locked resources for assessment purposes and their usefulness is undermined when the source files (for example, solution manuals or test banks) are shared online or via social networks.
Supplementary resources are subject to copyright. Instructors are permitted to view, print or download these resources for use in their teaching, but may not change them or use them for commercial gain.
If you are having problems accessing these resources please contact email@example.com.
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email firstname.lastname@example.orgRegister Sign in
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.Continue ×
Are you sure you want to delete your account?
This cannot be undone.
Thank you for your feedback which will help us improve our service.
If you requested a response, we will make sure to get back to you shortly.×