| authors |
Bentley, Jon L., Haken, Dorothea and Saxe, James B. |
| year |
1978 |
| title |
A General Method for Solving Divide-and-Conquer Recurrences |
| source |
10 p Carnegie Mellon University: December, 1978. includes bibliography. |
| summary |
The complexity of divide-and-conquer algorithms is often described by recurrence relations of the form T(n) = kT(n/c) + f(n). The only method currently available for solving such recurrences consists of solution tables for fixed functions f and varying k and c. In this note the authors describe a unifying method for solving these recurrences that is both general in applicability and easy to apply without the use of large tables |
| keywords |
recursion, algorithms, divide-and-conquer |
| series |
CADline |
| references |
Content-type: text/plain
|
| last changed |
2003/06/02 13:58 |
|
