On the balanced divide and conquer equation
Vladimir Batagelj
Abstract
Vladimir Batagelj
Abstract
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.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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.
Key concepts: Divide and conquer algorithms, Mathematics, Set (abstract data type), Applied mathematics, Algorithm, Computer science, Theoretical computer science, Programming language