[ 07.html ]
[ Recursive_definition ]
on the Wikipedia
and do Review Questions from chapter 10.
[ Fractals ]
(They won't be tested...)
Hand in one question+answer at the start of class.
What ever state your project 1 is in -- hand it in NOW.
- journey::=wriggle straight wriggle.
- wriggle::= single_step | journey.
Given: two functions f and g and a range a..b,
Goal: Display a curve that follows
- (x,y) = (f(t), g(t)), t : [a..b],
with in error ε, using straight line segments.
How to find a lion in the bush?
[ binrec.cpp ]
[ 08ex.cpp ]
The book (section 10.6) shows how the defining
property of Fibbonaci numbers leads directly to a
simple but inefficient program. However Fibbonaci numbers
have many other properties, see
[ Fibonacci_numbers ]
Here is a faster way to generate fibbonaci numbers:
[ fastfibo.cpp ]
. . . . . . . . . ( end of section Class Work) <<Contents | End>>
[ Towers_of_Hanoi ]
Bring to class -- a deck of 52 cards!
[ 09.html ]
Next project due in session 12, bonus session 11.
Next quiz in session 12.