Class 08: Continuations, Continued

Held Wednesday, February 10

Summary

• Tail recursion
• Writing permute recursively

Contents

Notes

• As you can tell, I've rearranged the schedule slightly.
• Are there questions on the homework? I'm happy to discuss the overall strategy for ``recursive permutation computation''.
• Are there questions on what we discussed on Monday?
• Today, we'll have a quiz.
• We'll also discuss the questions you'd had for today.
  • Make factorial tail-recursive
  • Make exp tail-recursive
• Reminder: exam 1 will be distributed on Friday and due the following Friday. It will cover functional programming in Scheme and language design issues.

Tail recursion, redefined

No notes available.

Tail recursive factorial

No notes available.

Generating permutations

No notes available.

History

• Created Tuesday, January 19, 1999 as a blank outline.
• Filled in the details on Wednesday, February 10, 1999.
• Moved the details to the subsequent outline on Thursday, February 11, 1999. (The introductory discussion took the full class session.)