Sprache: Englisch
Verlag: Cambridge University Press, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Anbieter: GreatBookPrices, Columbia, MD, USA
EUR 66,87
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Sprache: Englisch
Verlag: Cambridge University Press, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Anbieter: Lucky's Textbooks, Dallas, TX, USA
EUR 65,69
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Sprache: Englisch
Verlag: Cambridge University Press, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Anbieter: California Books, Miami, FL, USA
Zustand: New.
Sprache: Englisch
Verlag: Cambridge University Press, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Anbieter: GreatBookPrices, Columbia, MD, USA
EUR 76,12
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: As New. Unread book in perfect condition.
Sprache: Englisch
Verlag: Cambridge University Press, Cambridge, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Anbieter: Grand Eagle Retail, Bensenville, IL, USA
Hardcover. Zustand: 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.
Sprache: Englisch
Verlag: Cambridge University Press, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Anbieter: Greener Books, London, Vereinigtes Königreich
EUR 64,24
Anzahl: 1 verfügbar
In den WarenkorbHardcover. Zustand: 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.
Sprache: Englisch
Verlag: Cambridge University Press CUP, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Anbieter: Books Puddle, New York, NY, USA
Zustand: New.
Sprache: Englisch
Verlag: Cambridge University Press, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Anbieter: Majestic Books, Hounslow, Vereinigtes Königreich
EUR 80,93
Anzahl: 1 verfügbar
In den WarenkorbZustand: New.
Sprache: Englisch
Verlag: Cambridge University Press, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
EUR 76,50
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Sprache: Englisch
Verlag: Cambridge University Press, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Anbieter: Biblios, Frankfurt am main, HESSE, Deutschland
Zustand: New.
Sprache: Englisch
Verlag: Cambridge University Press, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
EUR 78,62
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: As New. Unread book in perfect condition.
Sprache: Englisch
Verlag: Cambridge University Press, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
EUR 101,91
Anzahl: 2 verfügbar
In den WarenkorbHardcover. Zustand: Brand New. 450 pages. 9.75x6.75x1.25 inches. In Stock.
Sprache: Englisch
Verlag: Cambridge University Press, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
EUR 72,17
Anzahl: 1 verfügbar
In den WarenkorbHardcover. Zustand: Brand New. 450 pages. 9.75x6.75x1.25 inches. In Stock. This item is printed on demand.
Sprache: Englisch
Verlag: Cambridge University Press, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Anbieter: THE SAINT BOOKSTORE, Southport, Vereinigtes Königreich
EUR 76,51
Anzahl: Mehr als 20 verfügbar
In den WarenkorbHardback. Zustand: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 931.
Sprache: Englisch
Verlag: Cambridge University Press, Cambridge, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Anbieter: CitiRetail, Stevenage, Vereinigtes Königreich
EUR 78,20
Anzahl: 1 verfügbar
In den WarenkorbHardcover. Zustand: 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.
Anbieter: moluna, Greven, Deutschland
EUR 76,19
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: 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 .
Sprache: Englisch
Verlag: Cambridge University Press, Cambridge, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Anbieter: AussieBookSeller, Truganina, VIC, Australien
Hardcover. Zustand: 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.