Advertisement
Published in:
2009 | OriginalPaper | Chapter
Recursive Algorithms and the Contraction Method
Published in: Random Trees
Publisher: Springer Vienna
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Recursive Algorithms follow the Divide-and-Conquer-Principle. The idea behind this principle is to break a problem into two or several subproblems which are easier to solve (heuristically because they are just smaller problems) and then to construct the solution of the original problem by combining the solutions of the subproblems appropriately. If this idea is iteratively (or recursively) applied then one speaks of a
recursive algorithm
and, moreover, these kinds of algorithms give rise to a (hidden) tree structure.