Algorithms whose recurrence is of the form
- T(n) = T(n/c) + f(n),
where c is a constant. For f(n) = O(1) this has solution T(n) = Θ(log n); for larger f(n) the solution will usually be Θ(f(n)).
Examples:
[FrontPage] [TitleIndex] [WordIndex]
|
|
[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.
Algorithms whose recurrence is of the form
where c is a constant. For f(n) = O(1) this has solution T(n) = Θ(log n); for larger f(n) the solution will usually be Θ(f(n)).
Examples: