Lingua: Inglese
Editore: Cambridge University Press, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: New.
Lingua: Inglese
Editore: Cambridge University Press, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Condizione: New.
Lingua: Inglese
Editore: Cambridge University Press, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Da: California Books, Miami, FL, U.S.A.
EUR 73,79
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Lingua: Inglese
Editore: Cambridge University Press, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: As New. Unread book in perfect condition.
Lingua: Inglese
Editore: Cambridge University Press, Cambridge, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Da: Grand Eagle Retail, Bensenville, IL, U.S.A.
Hardcover. Condizione: 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.
Lingua: Inglese
Editore: Cambridge University Press, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Da: Greener Books, London, Regno Unito
EUR 64,22
Quantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: 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.
Lingua: Inglese
Editore: Cambridge University Press CUP, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Da: Books Puddle, New York, NY, U.S.A.
Condizione: New.
Lingua: Inglese
Editore: Cambridge University Press, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Da: Majestic Books, Hounslow, Regno Unito
EUR 80,87
Quantità: 1 disponibili
Aggiungi al carrelloCondizione: New.
Lingua: Inglese
Editore: Cambridge University Press, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 76,47
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Lingua: Inglese
Editore: Cambridge University Press, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Da: Biblios, Frankfurt am main, HESSE, Germania
EUR 81,83
Quantità: 1 disponibili
Aggiungi al carrelloCondizione: New.
Lingua: Inglese
Editore: Cambridge University Press, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 78,60
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Lingua: Inglese
Editore: Cambridge University Press, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Da: Revaluation Books, Exeter, Regno Unito
EUR 101,87
Quantità: 2 disponibili
Aggiungi al carrelloHardcover. Condizione: Brand New. 450 pages. 9.75x6.75x1.25 inches. In Stock.
Lingua: Inglese
Editore: Cambridge University Press, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Da: Revaluation Books, Exeter, Regno Unito
EUR 72,14
Quantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: Brand New. 450 pages. 9.75x6.75x1.25 inches. In Stock. This item is printed on demand.
Lingua: Inglese
Editore: Cambridge University Press, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
EUR 76,48
Quantità: Più di 20 disponibili
Aggiungi al carrelloHardback. Condizione: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 931.
Lingua: Inglese
Editore: Cambridge University Press, Cambridge, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Da: CitiRetail, Stevenage, Regno Unito
EUR 78,17
Quantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: 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.
Da: moluna, Greven, Germania
EUR 76,19
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: 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 .
Lingua: Inglese
Editore: Cambridge University Press, Cambridge, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Da: AussieBookSeller, Truganina, VIC, Australia
EUR 105,98
Quantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: 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.