Description: 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.
Price: 99.89 AUD
Location: Hillsdale, NSW
End Time: 2024-12-07T20:13:39.000Z
Shipping Cost: 32.57 AUD
Product Images
Item Specifics
Return shipping will be paid by: Buyer
Returns Accepted: Returns Accepted
Item must be returned within: 60 Days
Return policy details:
EAN: 9781108491617
UPC: 9781108491617
ISBN: 9781108491617
MPN: N/A
Item Length: 24.9 cm
Number of Pages: 450 Pages
Language: English
Publication Name: Algorithm Design with Haskell
Publisher: Cambridge University Press
Publication Year: 2020
Subject: Computer Science
Item Height: 252 mm
Item Weight: 930 g
Type: Textbook
Author: Richard Bird, Jeremy Gibbons
Item Width: 178 mm
Format: Hardcover
