BU CLA CS 530: Analysis of Algorithms

Spring 1996

Useful Pointers


Solving Recurrences:

Often you will be in a situation when you can generate more and more entries in a potentially infinite sequence of integers. You will try to guess a recurrence relation that defines the sequence. But if you fail, try the following www page for some hints:

ftp://netlib.att.com/netlib/att/math/sloane/doc/eistop.html


Assaf Kfoury
Created: 96.01.31
Modified: 96.02.02