PineWikiAlgorithms 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:
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:
DecreaseByConstantFactor (last edited 2007-12-25 23:42:21 by localhost)