Chapter 1
Find the maximum
Chapter 1.3.2 | Program M
Print table of 500 primes
Chapter 1.3.2 | Program P
Multiply permutations in cycle form
Chapter 1.3.3 | Program A
Multiply permutations in cycle form
Chapter 1.3.3 | Program B
Reverse in place
Chapter 1.3.3 | Program I
Reverse in place
Chapter 1.3.3 | Program J
Translate code with coroutines
Chapter 1.4.2 | Coroutines
Trace routine
Chapter 1.4.3.2 | Trace routine
Chapter 2
Topological sort
Chapter 2.2.3 | Program T
Addition of polynomials
Chapter 2.2.4 | Program A
Traverse binary tree in inorder
Chapter 2.3.1 | Program T
Traverse threaded binary tree in inorder
Chapter 2.3.1 | Program S
Chapter 3
Additive number generator
Chapter 3.2.2 | Program A
Chapter 4
Floating point arithmetic
Chapter 4.2.1 | Programs A and M
Double-precision arithmetic
Chapter 4.2.3 | Programs A, M, and D
Addition of nonnegative integers
Chapter 4.3.1 | Program A
Subtraction of nonnegative integers
Chapter 4.3.1 | Program S
Multiplication of nonnegative integers
Chapter 4.3.1 | Program M
Euclid’s algorithm
Chapter 4.5.2 | Program A
Binary gcd algorithm
Chapter 4.5.2 | Program B
Chapter 5
Comparison counting
Chapter 5.2 | Program C
Straight insertion sort
Chapter 5.2.1 | Program S
Shellsort
Chapter 5.2.1 | Program D
List insertion
Chapter 5.2.1 | Program L
Multiple list insertion
Chapter 5.2.1 | Program M
Bubble sort
Chapter 5.2.2 | Program B
Quicksort
Chapter 5.2.2 | Program Q
Radix exchange sort
Chapter 5.2.2 | Program R
Straight selection sort
Chapter 5.2.3 | Program S
Heapsort
Chapter 5.2.3 | Program H
List merge sort
Chapter 5.2.4 | Program L
Radix list sort
Chapter 5.2.5 | Program R
Chapter 6
Sequential search
Chapter 6.1 | Program S
Quick sequential search
Chapter 6.1 | Program Q
Quicker sequential search
Chapter 6.1 | Program Q′
Binary search
Chapter 6.2.1 | Program B
Uniform binary search
Chapter 6.2.1 | Program C
Fibonaccian search
Chapter 6.2.1 | Program F
Tree search and insertion
Chapter 6.2.2 | Program T
Balanced tree search and insertion
Chapter 6.2.3 | Program A
Trie search
Chapter 6.3 | Program T
Chained hash table search and insertion
Chapter 6.4 | Program C
Linear probing and insertion
Chapter 6.4 | Program L
Open addressing with double hashing
Chapter 6.4 | Program D