Algorithm Design with Haskell
Vi har samlet 2 aktuelle varer med samme produktnavn hos Saxo DK på én side.
Denne side samler varer efter forhandler og produktnavn. Det betyder ikke nødvendigvis, at varerne er officielle varianter af samme produkt.
Muligheder hos forhandleren
Vi kan ikke med sikkerhed afgøre, om varerne er varianter eller separate produkter. Sammenlign detaljerne før du går videre.
| Produkt | Varenr. | Pris | Handling |
|---|---|---|---|
| Algorithm Design with Haskell | 9781108491617 | 509,95 kr | Til butik |
| Algorithm Design with Haskell | 9781108491617 | 509,95 kr | Til butik |
Produktdetaljer
Algorithm Design with Haskell
509,95 kr
Til butik- Varenr.:
- 9781108491617
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.
Læs mere hos Saxo DKAlgorithm Design with Haskell
509,95 kr
Til butik- Varenr.:
- 9781108491617
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.
Læs mere hos Saxo DKOplysningerne kommer fra Saxo DKs aktuelle produktdata.