Classic Computer Science Problems in Swift

List of Figures

Chapter 1. Small problems

Figure 1.1. The height of each stickman is the addition of the previous two stickmen’s heights added together.

Figure 1.2. The recursive function fib(n) calls itself with the arguments n-2 and n-1.

Figure 1.3. Every non-base-case call of fib2() results in two more calls of fib2().

Figure 1.4. The human memoization machine

Figure 1.5. Compressing a String representing a gene into a 2-bit-per-nucleotide bit string.

Figure 1.6. A one-time pad results in two keys that can be separated and then recombined to recreate the original data.

Figure 1.7. The challenge is to move the three discs, one at a time, from tower A to tower C. A larger disc may never be on top of a smaller disc.

Chapter 2. Search problems ...