Answers are grounded in this paper and cite their sources.
The approximate complexity of divide-and-conquer algorithms is often described by recurrence relations of the formT(n) = kT(n/c) + f(n).The only well-defined method currently used for solving such recurrences consists of solution tables for fixed functions f and varying k and c. In this note we describe a unifying method for solving these recurrences that is both general in applicability and easy to apply. This method is appropriate both as a classroom technique and as a tool for practicing algorithm designers.
No takes yet. Share an insight, caveat, or question.
Bentley et al. (1980) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: