In some problems, we will need to recur on quantities that are not pieces of the input structure. We call this "general recursion." In this module, you will see examples of problems that are solvable by general recursion. You will also see how invariants can be used as a tool to express deep knowledge about how and why our programs work, and as a tool to guide the development of our programs.

Part V from the textbook. we are doing this topic rather differently than the textbook does, so use the textbook for background rather than as a normative reference.

- Lesson 8.1 Introducing General Recursion
- Guided Practice 8.1
- Lesson 8.2 Halting Measures
- Guided Practice 8.2
- Lesson 8.3 Linear Search
- Guided Practice 8.3
- Lesson 8.4 Binary Search
- Guided Practice 8.4
- Lesson 8.5 Searching in a Graph
- Lesson 8.6 Integer Square Root
- Lesson 8.7 Midterm Review

Last modified: Wed Oct 26 07:38:27 Eastern Daylight Time 2016