Recursion

The early work done by Church, Gödel, Kleene, and Turing on recursive function and computability laid the groundwork that made recursion possible in programming languages.

Each bucket is then sorted individually, either using a different sorting algorithm, or by recursively applying the bucket sorting algorithm.

Unlike in depth-first search, when the depth-first search recursively visits a node v and its descendants, those nodes are not all necessarily popped from the stack when this recursive call returns.

For each vertex u of the graph do Visit(u), where Visit(u) is the recursive subroutine: If u is unvisited then: Mark u as visited.

It follows that the number of recursive calls is ⌈ log 2 ⁡ n ⌉ , {\displaystyle \lceil \log _{2}n\rceil ,} the number of bits of the binary representation of n.

The Baum-Welch algorithm, the primary method for inference in hidden Markov models, is numerically unstable due to its recursive calculation of joint probabilities.

With the sorter for k = 1 {\displaystyle k=1} , we can recursively create a sorter of higher order.

In graph theory, the Stoer-Wagner algorithm is a recursive algorithm to solve the minimum cut problem in undirected weighted graphs with non-negative weights.

The algorithm has a recursive description.

The multiplication sub-operations can then be computed recursively using Toom-Cook multiplication again, and so on.

Authority and hub values are defined in terms of one another in a mutual recursion.

Strand sort is a recursive sorting algorithm that sorts items of a list into increasing order.

Described recursively as a decrease and conquer method, Heap's algorithm operates at each step on the k {\displaystyle k} initial elements of the collection.

The PageRank of a page is defined recursively and depends on the number and PageRank metric of all pages that link to it ("incoming links").

The algorithm may then be applied recursively to these and subsequent divisors, until we find the decomposition of f ( x ) {\displaystyle f(x)} into powers of irreducible polynomials (recalling that the ring of polynomials over a finite field is a unique factorization domain).

These algorithms proceed by a recursion on the number of variables to reduce the problem to a variant of the Euclidean algorithm.

When a trial division is successful, the process is applied recursively to the resulting quotient.

It recursively splits the input number into high and low halves, computes the square root of the higher half, and then determines the lower half algebraically.

Stooge sort is a recursive sorting algorithm.

Recursion occurs when the definition of a concept or process depends on a simpler or previous version of itself.