|
[FrontPage] [TitleIndex] [WordIndex] |
Note: You are looking at a static copy of the former PineWiki site, used for class notes by James Aspnes from 2003 to 2012. Many mathematical formulas are broken, and there are likely to be other bugs as well. These will most likely not be fixed. You may be able to find more up-to-date versions of some of these notes at http://www.cs.yale.edu/homes/aspnes/#classes.
General pattern for algorithms whose recurrence includes only one recursive term. Special cases are:
DecreaseByConstant: T(n) = T(n-c) + f(n).
DecreaseByConstantFactor: T(n) = T(n/c) + f(n).
DecreaseByVariableFactor: T(n) = T(k) + f(n), where k may be a RandomVariable or depend on the problem instance.
Some operations on BinaryTrees.