pearls

Pearls of Functional Algorithm Design

These are the code examples that go with Richard Bird's Pearls of Functional Algorithm Design.

All the examples are working Haskell programs. For each I've included some short notes of my own on any issues in getting them to work.

• Chapter 1 - The Smallest Free Number
• Chapter 2 - A Surpassing Problem
• Chapter 3 - Improving on Saddleback Search
• Chapter 4 - A Selection Problem
• Chapter 5 - Sorting Pairwise Sums
• Chapter 6 - Making a Century
• Chapter 7 - Building a Tree with Minimum Height
• Chapter 8 - Unravelling Greedy Algorithms
• Chapter 9 - Finding Celebrities
• Chapter 10 - Removing Duplicates
• Chapter 11 - Maximum Non-Segment Sum
• Chapter 12 - Ranking Suffixes
• Chapter 13 - The Burrows Wheeler Transform
• Chapter 14 - The Last Tail
• Chapter 15 - All The Common Prefixes