But there is more to this book. How do you make a computer sort names into alphabetical order? Not as obvious as it might seem. Three different sorting techniques are explained by example in this book: bubble sort, monkey puzzle (more formally the “binary tree”) and Quicksort. Quicksort relies on “recursion” – an important programming concept which is explained and demonstrated. Making coloured objects rebound around the walls of a squash court is another technique demonstrated; so is making voices sing in harmony; so is computerizing a humble address book.
Concepts are introduced by example, using few words and many diagrams.