An edition of Pearls of Functional Algorithm Design
(2010)
Pearls of Functional Algorithm Design
by Richard Bird
Share
×Close
A radical new approach to algorithm design, namely, design by calculation.
Check nearby libraries
Buy this book
Subjects
Computer Science, IT| Edition | Availability |
|---|---|
1
Pearls of Functional Algorithm Design
2010, Cambridge University Press
electronic resource
in English
0511900449 9780511900440
|
aaaa
|
Book Details
Table of Contents
Cover; Half-title; Title; Copyright; Dedication; 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 BurrowsWheeler transform; 14 The last tail; 15 All the common prefixes; 16 The Boyer
Moore algorithm; 17 The KnuthMorrisPratt algorithm; 18 Planning solves the Rush Hour problem.
19 A simple Sudoku solver20 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 SchorrWaite algorithm; 27 Orderly insertion; 28 Loopless functional algorithms; 29 The JohnsonTrotter algorithm; 30 Spider spinning for dummies; Index.
Edition Notes
Description based on print version record.
Classifications
External Links
The Physical Object
Edition Identifiers
Work Identifiers
Source records
Community Reviews (0)
Lists
History
- Created July 6, 2019
- 3 revisions
Wikipedia citation
×CloseCopy and paste this code into your Wikipedia page. Need help?
| March 28, 2025 | Edited by ImportBot | Redacting ocaids |
| November 20, 2022 | Edited by ImportBot | import existing book |
| July 6, 2019 | Created by MARC Bot | Imported from Internet Archive item record |