Outline for April 26, 2002 Handouts: none Reading: Johnsonbaugh and Kalin, pp.195Ð214 1. Greetings and felicitations! a. Please make an appointment with the TAs for grading now or we will get nasty É 2. Recursion a. Quick review: base case, recursive case; relation to mathematical induction b. GCD; show call stack c. Sort; chow algorithm in detail, then work example 3. Structures a. Simple student/student ID array b. Linked lists