Publicado por Cambridge University Press, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Idioma: Inglés
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 72,96
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Publicado por Cambridge University Press, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Idioma: Inglés
Librería: California Books, Miami, FL, Estados Unidos de America
EUR 74,00
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Publicado por Cambridge University Press, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Idioma: Inglés
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 67,01
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Publicado por Cambridge University Press CUP, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Idioma: Inglés
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 78,90
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoCondición: New.
Publicado por Cambridge University Press, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Idioma: Inglés
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 72,95
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Publicado por Cambridge University Press, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Idioma: Inglés
Librería: Majestic Books, Hounslow, Reino Unido
EUR 82,90
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoCondición: New.
Publicado por Cambridge University Press, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Idioma: Inglés
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 79,47
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Publicado por Cambridge University Press, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Idioma: Inglés
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 79,62
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Publicado por Cambridge University Press, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Idioma: Inglés
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 86,16
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoCondición: New.
Publicado por Cambridge University Press, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Idioma: Inglés
Librería: Revaluation Books, Exeter, Reino Unido
EUR 102,01
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoHardcover. Condición: Brand New. 450 pages. 9.75x6.75x1.25 inches. In Stock.
Publicado por Cambridge University Press, Cambridge, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Idioma: Inglés
Librería: CitiRetail, Stevenage, Reino Unido
EUR 78,03
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: 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 our UK warehouse or from our Australian or US warehouses, depending on stock availability.
Publicado por Cambridge University Press, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Idioma: Inglés
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
EUR 65,83
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Publicado por Cambridge University Press, Cambridge, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Idioma: Inglés
Librería: AussieBookSeller, Truganina, VIC, Australia
EUR 100,31
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: 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 our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.
Publicado por Cambridge University Press, Cambridge, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Idioma: Inglés
Librería: Grand Eagle Retail, Mason, OH, Estados Unidos de America
EUR 80,44
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: 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.
Publicado por Cambridge University Press, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Idioma: Inglés
Librería: Revaluation Books, Exeter, Reino Unido
EUR 73,11
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: Brand New. 450 pages. 9.75x6.75x1.25 inches. In Stock. This item is printed on demand.
Publicado por Cambridge University Press, 2020
ISBN 10: 1108491618 ISBN 13: 9781108491617
Idioma: Inglés
Librería: THE SAINT BOOKSTORE, Southport, Reino Unido
EUR 76,64
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoHardback. Condición: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 931.
Librería: moluna, Greven, Alemania
EUR 76,19
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: 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 .