Comp 388-005 Week 3
Lewis Tower 415, 4:15-8:15
Start with recursive Fibonacci
Readings:
Bailey chapter 6, on Sorting
Sorting notes
Recursion notes
Topics in brief
- Recursion
- Factorial
- Fibonacci
- Induction
- Postage (currently first-class is 49¢ and post cards are 35¢)
- Expressions
Go through these examples in recursion.html.
in-class lab 1
Answer-cache implementation of Fibonacci(n):
public static long
rfibonacci(int N) {
if (N<=1) return 1;
if rfibonacci(N) is in the answer
cache, return answer_cache[N]
return rfibonacci1(N-2) +
rfibonacci1(N-1); // but put result
into answer_cache[N] first
}
in-class lab 2
Get expr_assign.cs
(with oneline_tokenizer.cs)
to run
Both files together are in expr_assign_all.cs
Linked Lists: lists.html#linked
Hashing: lists.html#hashing
in-class lab: GetHashCode() values of strings in lab1