Language: English
Published by Cambridge University Press, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New.
Language: English
Published by Cambridge University Press, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Condition: New.
Language: English
Published by Cambridge University Press, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Seller: California Books, Miami, FL, U.S.A.
Condition: New.
Language: English
Published by Cambridge University Press, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: As New. Unread book in perfect condition.
Language: English
Published by Cambridge University Press, Cambridge, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.
Hardcover. Condition: new. 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. 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
Language: English
Published by Cambridge University Press, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Seller: Greener Books, London, United Kingdom
US$ 75.27
Quantity: 1 available
Add to basketHardcover. Condition: Used; Very Good. **SHIPPED FROM UK** We believe you will be completely satisfied with our quick and reliable service. All orders are dispatched as swiftly as possible! Buy with confidence! Greener Books.
Language: English
Published by Cambridge University Press CUP, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Seller: Books Puddle, New York, NY, U.S.A.
Condition: New.
Language: English
Published by Cambridge University Press, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Seller: Majestic Books, Hounslow, United Kingdom
Condition: New.
Language: English
Published by Cambridge University Press, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
US$ 89.63
Quantity: Over 20 available
Add to basketCondition: New.
Language: English
Published by Cambridge University Press, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Seller: Biblios, Frankfurt am main, HESSE, Germany
Condition: New.
Language: English
Published by Cambridge University Press, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
US$ 92.11
Quantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
Language: English
Published by Cambridge University Press, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Seller: Revaluation Books, Exeter, United Kingdom
US$ 119.39
Quantity: 2 available
Add to basketHardcover. Condition: Brand New. 450 pages. 9.75x6.75x1.25 inches. In Stock.
Language: English
Published by Cambridge University Press, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Seller: Revaluation Books, Exeter, United Kingdom
US$ 84.55
Quantity: 1 available
Add to basketHardcover. Condition: Brand New. 450 pages. 9.75x6.75x1.25 inches. In Stock. This item is printed on demand.
Language: English
Published by Cambridge University Press, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
US$ 89.64
Quantity: Over 20 available
Add to basketHardback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 931.
Language: English
Published by Cambridge University Press, Cambridge, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Seller: CitiRetail, Stevenage, United Kingdom
US$ 91.62
Quantity: 1 available
Add to basketHardcover. Condition: new. 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. 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. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.
Seller: moluna, Greven, Germany
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 .
Language: English
Published by Cambridge University Press, Cambridge, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Seller: AussieBookSeller, Truganina, VIC, Australia
Hardcover. Condition: new. 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. 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. This item is printed on demand. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.