On the balanced divide and conquer equation
Vladimir Batagelj · International Journal of Computer Mathematics · 1986
In the paper a general approach for solving the balanced divide and conquer equation, which describes the complexity of the algorithms based on the “divide and conquer” principle, is presented. A method for solving this equation by the change of the index set is proposed. The explicit solutions for some special types of the “divide and conquer” equation are also given.