Algorithm Design with Haskell (Hardcover)

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.

General

Imprint:	Cambridge UniversityPress
Country of origin:	United Kingdom
Release date:	July 2020
Authors:	Richard Bird • Jeremy Gibbons
Dimensions:	252 x 178 x 29mm (L x W x T)
Format:	Hardcover
Pages:	450
ISBN-13:	978-1-108-49161-7
Categories:	Books > Computing & IT > General theory of computing > Data structures Books > Computing & IT > Computer programming > Algorithms & procedures Books > Computing & IT > Applications of computing > General Books > Computing & IT > Computer programming > Programming languages > General
LSN:	1-108-49161-8
Barcode:	9781108491617

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!