Pearls of Functional Algorithm Design
Publisher: Cambridge University Press
Published: 2010
Place of publication: Leiden
Language: eng
Format: [electronic resource]
Number of pages: 291
ISBN-13: 9780511900440
Subjects: Computer Science; IT
Description: A radical new approach to algorithm design, namely, design by calculation.
Notes: Description based on print version record.
Table of contents: title: 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; title: Moore algorithm; 17 The KnuthMorrisPratt algorithm; 18 Planning solves the Rush Hour problem.; title: 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.