These are my notes from 6th lecture of discrete mathematics course taught at Arsdigita university by Shai Simonson. Other posts relating to this are here.

In this lecture we're introduced to recursion and recurrence relations which arise in analysis of recursive algorithms, "repeated substitution"... the very basic technique of solving recurrence relations is covered with tower of hanoi puzzle as an example.

Here are my notes....

## Saturday, August 22, 2009

Subscribe to:
Post Comments (Atom)

## No comments:

## Post a Comment