Chapter

Scaling a Value . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

From ComputerScienceOne by Dr Chris Bourke

Concepts

1. What are functions in pseudocode and how are they used?

   "5.1. A function in pseudocode . . . . . . . . . . . . . . . . . . . . . . . . . . . 135 5.2. Using a function . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 137"

2. What is a recursive CountDown function?

   "11.1. Recursive CountDown ( n ) Function . . . . . . . . . . . . . . . . . . . . . 203"

3. How do recursive Fibonacci functions work with memoization?

   "11.2. Recursive Fibonacci ( n ) Function . . . . . . . . . . . . . . . . . . . . . 204 11.3. Recursive Fibonacci ( n ) Function With Memoization . . . . . . . . . . . 208"