Unit 7 -- Csc 115 Spring 2005 SO1/SO2
Learning Objectives for this unit
- Understand the difference between Iteration vs. Recursion
- gain knowledge about how to design recursive algorithms
- Big O revisited -- impact of different algorithms on efficiency
Learning Resources for this week
Lecture slides:
7-Recursion.ppt
Sample programs as found in the source directory of this project.
Reading Assignment:
Read Chapter 2.5.1 and 4.1
Activities:
Short Answer Questions
Answer the following questions:
- What is the running time of the binary fibonacci algorithm (described in class and in the textbook)?
- T/F: Any algorithm you define recursively can always be implemented iteratively.
Programming exercises
There are some exercises at this
website