Linked from

The 19 pages that link to Recursion, each with the reason it gives.

• AlgorithmRelated: Recursive algorithms organize repeated work through smaller versions of the same problem.

• Dynamic programmingNarrower topic: Dynamic programming commonly begins with a recursive formulation of its subproblems.

• Depth-first searchRelated: Recursive DFS stores unfinished visits in the program's call stack.

• FractalRelated: Iterated rules generate many fractals from simple starting forms.

• BacktrackingRelated: Recursive calls often represent successive choices, with returns undoing each completed branch.

• Generative grammarRelated: Recursive structure helps explain how finite grammatical resources can support indefinitely many expressions.

• Catalan numberRelated: Many Catalan-counted objects decompose into smaller objects of the same kind.

• Merge sortRelated: Each merge-sort call sorts a smaller subproblem until it reaches a base case.

• Functional programmingRelated: Recursion often replaces changing loop counters and accumulators.

• QuicksortRelated: Quicksort applies itself to the partitions until subarrays need no further sorting.

• Self-referenceRelated: Recursion is a structured form of self-application that can terminate or continue indefinitely.

• Binary search treeRelated: Search and updates naturally continue on one child subtree at a time.

• Binary treeRelated: A binary tree naturally divides into left and right subtrees for recursive processing.

• Divide-and-conquer algorithmRelated: Each recursive call solves a smaller subproblem until a base case is reached.

• ALGOL 60Related: ALGOL 60 procedures could call themselves, enabling recursive algorithms.

• In-place algorithmRelated: Recursive calls consume stack space, which can complicate an in-place classification.

• Tower of HanoiNarrower topic: The optimal solution moves a smaller stack aside, moves the largest disk, then solves another smaller instance.

• Discrete mathematicsRelated: Recursive definitions build sequences, trees, and algorithms from discrete cases.

• Programming paradigmRelated: Functional programs often use recursive definitions instead of mutable loops.