Pearls of Functional Algorithm Design

Pearls of Functional Algorithm Design

Bird, Richard

Cambridge University Press

09/2010

290

Dura

Inglês

9780521513388

15 a 20 dias

This book takes a radical approach to algorithm design, namely, design by calculation.
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.
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.