BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

Algorithm Design with Haskell

Algorithm Design with Haskell

Algorithm Design with Haskell Hardback - 2020

by Richard Bird

Add to wish list
  • New
  • Hardback
New

Description

Hardback. New. 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.
Ask the seller a question Add to wish list
A$129.33
A$19.30 Delivery to USA
Standard delivery: 14 to 21 days
More delivery options
Ships from The Saint Bookstore (Merseyside, United Kingdom)
Biblio Top Seller
The BIBLIO Guarantee

Details

  • Title Algorithm Design with Haskell
  • Author Richard Bird
  • Binding Hardback
  • Condition New
  • Pages 450
  • Volumes 1
  • Language ENG
  • Publisher Cambridge University Press
  • Publication date 2020-07-09
  • Features Index
  • Bookseller's Inventory # B9781108491617
  • ISBN 9781108491617 / 1108491618
  • Weight 2 lbs (0.91 kg)
  • Dimensions 9.8 x 7.6 x 1.1 in (24.89 x 19.30 x 2.79 cm)
  • Category Computers - Languages / Programming
  • Library of Congress subjects Computer algorithms, Functional programming (Computer science)
  • Library of Congress Catalogue Number 2020009121
  • Dewey Decimal Code 005.13
  • Quantity available 10

About The Saint Bookstore Merseyside, United Kingdom

Specialising in: Academic & Scholarly, Hard To Find Titles, Textbooks
Biblio member since 2018

The Saint Bookstore specialises in hard to find titles & also offers delivery worldwide for reasonable rates.

Terms of Sale: Refunds or Returns: A full refund of the price paid will be given if returned within 30 days in undamaged condition. If the product is faulty, we may send a replacement.

Browse books from The Saint Bookstore

Reader reviews for Algorithm Design with Haskell

Write a review for this book

There are no reviews for this book yet. Be the first to write a review!

Your review will be anonymous unless you login or create an account first.

Overall rating
Remember: You’re rating the book as a work, not the seller or the condition of the specific copy you purchased!

Important Terms and Guidelines

  • Please focus on the book’s content and context. Also, add any personal comments as to how you enjoyed the book. Substantiate your likes and dislikes. You may make comparisons to other books.
  • Reviews must be at least 140 characters in length.
  • Please do not reveal critical plot elements.
  • This is not a help line. Contact customer support if you need help.
Your review must not include:
  • Obscenities, discriminatory language, or other insulting language not suitable for public domain
  • Advertisements, “spam” content, or references to other products, offers or websites.
  • Email addresses, URLs, phone numbers, physical addresses or other contact information.
  • Overly critical comments about other reviews or reviewers
  • Time-sensitive material (i.e. promotional tours, seminars, lectures, etc.)
  • Availability, price, or alternative ordering/shipping information

From the publisher

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.

Please wait a moment while we load the requested page.

tracking-