|Eingestellt in Kategorie:
Ähnlichen Artikel verkaufen?

Pearls of Functional Algorithm Design

warriorssalesgroup
(1443)
Angemeldet als gewerblicher Verkäufer
US $71,81
Ca.CHF 57,30
Artikelzustand:
Neu
Ganz entspannt. Rückgaben akzeptiert.
Schnell, bevor er weg ist. 1 Person beobachtet diesen Artikel.
Versand:
Kostenlos USPS Media MailTM.
Standort: Somerset, New Jersey, USA
Lieferung:
Lieferung zwischen Sa, 26. Jul und Sa, 2. Aug nach 94104 bei heutigem Zahlungseingang
Wir wenden ein spezielles Verfahren zur Einschätzung des Liefertermins an – in diese Schätzung fließen Faktoren wie die Entfernung des Käufers zum Artikelstandort, der gewählte Versandservice, die bisher versandten Artikel des Verkäufers und weitere ein. Insbesondere während saisonaler Spitzenzeiten können die Lieferzeiten abweichen.
Rücknahme:
30 Tage Rückgabe. Käufer zahlt Rückversand. Wenn Sie ein eBay-Versandetikett verwenden, werden die Kosten dafür von Ihrer Rückerstattung abgezogen.
Zahlungen:
     Diners Club

Sicher einkaufen

eBay-Käuferschutz
Geld zurück, wenn etwas mit diesem Artikel nicht stimmt. Mehr erfahreneBay-Käuferschutz - wird in neuem Fenster oder Tab geöffnet
Der Verkäufer ist für dieses Angebot verantwortlich.
eBay-Artikelnr.:167514664119
Zuletzt aktualisiert am 12. Jun. 2025 03:18:16 MESZAlle Änderungen ansehenAlle Änderungen ansehen

Artikelmerkmale

Artikelzustand
Neu: Neues, ungelesenes, ungebrauchtes Buch in makellosem Zustand ohne fehlende oder beschädigte ...
ISBN
9780521513388

Über dieses Produkt

Product Identifiers

Publisher
Cambridge University Press
ISBN-10
0521513383
ISBN-13
9780521513388
eBay Product ID (ePID)
84602067

Product Key Features

Number of Pages
290 Pages
Language
English
Publication Name
Pearls of Functional Algorithm Design
Publication Year
2010
Subject
Programming Languages / General, Algebra / General
Type
Textbook
Author
Richard Bird
Subject Area
Mathematics, Computers
Format
Hardcover

Dimensions

Item Height
0.7 in
Item Weight
25.8 Oz
Item Length
9.7 in
Item Width
6.9 in

Additional Product Features

Intended Audience
Scholarly & Professional
LCCN
2010-022871
Dewey Edition
22
Reviews
'… an excellent guide into this method of algorithm development.' Journal of Functional Programming, Though the writing is crisp, and the explanations lucid, this is not an easy book to read. The difficulty lies in the density of ideas presented. The rewards of persevering are definitely worth it, though. In fact, once immersed, I started to ponder where this material would lead to: which algorithms could be even further generalized, what would many of these algorithms look like if implemented in Coq or Agda, and so forth. This is the effect that all good books have on me: well-presented and well-motivated material strives to become a stepping stone to further discovery. Any serious computer scientist would benefit from reading and properly understanding this book. Jacques Carette, Computing Reviews|9780521513388|, '… well-presented and well-motivated material strives to become a stepping stone to further discovery. Any serious computer scientist would benefit from reading and properly understanding this book.' Computing Reviews
Illustrated
Yes
Dewey Decimal
005.1
Table Of Content
Preface; 1. The smallest free number; 2. A surpassing problem; 3. Improving on saddleback search; 4. A selection problem; 5. Sorting pairwise sums; 6. Making a century; 7. Building a tree with minimum height; 8. Unravelling greedy algorithms; 9. Finding celebrities; 10. Removing duplicates; 11. Not the maximum segment sum; 12. Ranking suffixes; 13. The Burrows-Wheeler transform; 14. The last tail; 15. All the common prefixes; 16. The Boyer-Moore algorithm; 17. The Knuth-Morris-Pratt algorithm; 18. Planning solves the rush hour problem; 19. A simple Sudoku solver; 20. The countdown problem; 21. Hylomorphisms and nexuses; 22. Three ways of computing determinants; 23. Inside the convex hull; 24. Rational arithmetic coding; 25. Integer arithmetic coding; 26. The Schorr-Waite algorithm; 27. Orderly insertion; 28. Loopless functional algorithms; 29. The Johnson-Trotter algorithm; 30. Spider spinning for dummies; Index.
Synopsis
Richard Bird takes a radical approach to algorithm design, namely, design by calculation. This unique collection of 30 programming problems draws from various sources including games and puzzles, sorting, and problems in data compression., Richard Bird takes a radical approach to algorithm design, namely, design by calculation. These 30 short chapters each deal with a particular programming problem drawn from sources as diverse as games and puzzles, intriguing combinatorial tasks, and more familiar areas such as data compression and string matching. Each pearl starts with the statement of the problem expressed using the functional programming language Haskell, a powerful yet succinct language for capturing algorithmic ideas clearly and simply. The novel aspect of the book is that each solution is calculated from an initial formulation of the problem in Haskell by appealing to the laws of functional programming. Pearls of Functional Algorithm Design will appeal to the aspiring functional programmer, students and teachers interested in the principles of algorithm design, and anyone seeking to master the techniques of reasoning about programs in an equational style., Richard Bird takes a radically new approach to algorithm design, namely, design by calculation. These 30 short chapters each deal with a particular programming problem drawn from sources as diverse as games and puzzles, intriguing combinatorial tasks, and more familiar areas such as data compression and string matching. Each pearl starts with the statement of the problem expressed using the functional programming language Haskell, a powerful yet succinct language for capturing algorithmic ideas clearly and simply. The novel aspect of the book is that each solution is calculated from an initial formulation of the problem in Haskell by appealing to the laws of functional programming. Pearls of Functional Algorithm Design will appeal to the aspiring functional programmer, students and teachers interested in the principles of algorithm design, and anyone seeking to master the techniques of reasoning about programs in an equational style.
LC Classification Number
QA76.62 .B57 2010

Artikelbeschreibung des Verkäufers

Info zu diesem Verkäufer

warriorssalesgroup

99,2% positive Bewertungen5.2 Tsd. Artikel verkauft

Mitglied seit Feb 2023
Angemeldet als gewerblicher Verkäufer
Shop besuchenKontakt

Detaillierte Verkäuferbewertungen

Durchschnitt in den letzten 12 Monaten
Genaue Beschreibung
4.9
Angemessene Versandkosten
5.0
Lieferzeit
5.0
Kommunikation
5.0

Verkäuferbewertungen (1'507)

Alle Bewertungen
Positiv
Neutral
Negativ