Search Results for ""

A prime factorization algorithm.

An algorithm for computing an Egyptian fraction.

A sorting algorithm which makes n passes over a set of n elements, in each pass selecting the smallest element and deleting it from the set. This algorithm has running time ...

A binary tree in which special nodes are added wherever a null subtree was present in the original tree so that each node in the original tree (except the root node) has ...

Wirsing (1974) showed, among other results, that if F_n(x) is the Gauss-Kuzmin distribution, then lim_(n->infty)(F_n(x)-lg(1+x))/((-lambda)^n)=Psi(x), (1) where ...

A number of the form n^...^_()_(n)n, where Knuth up-arrow notation has been used. The first few Ackermann numbers are 1^1=1, 2^^2=4, and ...

There exists a total computable predicate P such that for any algorithm computing P(x) with running time T(x), there exists another algorithm computing P(x) with computation ...

A method of solving combinatorial problems by means of an algorithm which is allowed to run forward until a dead end is reached, at which point previous steps are retraced ...

The power tower of order k is defined as a^^k=a^(a^(·^(·^(·^a))))_()_(k), (1) where ^ is Knuth up-arrow notation (Knuth 1976), which in turn is defined by ...

Quicksort is the fastest known comparison-based sorting algorithm (on average, and for a large number of elements), requiring O(nlgn) steps. Quicksort is a recursive ...