Search Results for ""

A topological sort is a permutation p of the vertices of a graph such that an edge {i,j} implies that i appears before j in p (Skiena 1990, p. 208). Only acyclic digraphs can ...

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 merge sort (or collation sort) is the combination of two or more ordered lists into a single ordered list (Knuth 1998, p. 158). Merge sorting was one of the first methods ...

The bead-sorting algorithm orders a list of a positive integers increasingly by representing numbers as a list of a 1s, where each 1 stands for a bead. The k initial integers ...

Many algorithms have been devised for determining the prime factors of a given number (a process called prime factorization). They vary quite a bit in sophistication and ...

The sequence produced by sorting the digits of a number and adding them to the previous number. The values starting with n=1, 2, ... are 2, 4, 6, 8, 10, 12, 14, 16, 18, 11, ...

A sequence of approximations a/b to sqrt(n) can be derived by factoring a^2-nb^2=+/-1 (1) (where -1 is possible only if -1 is a quadratic residue of n). Then ...

Sorting is the rearrangement of numbers (or other orderable objects) in a list into their correct lexographic order. Alphabetization is therefore a form of sorting. Because ...

An O(nlgn) sorting algorithm which is not quite as fast as quicksort. It is a "sort-in-place" algorithm and requires no auxiliary storage, which makes it particularly concise ...

Associated with an irreducible curve of curve genus p, there are p linearly independent integrals of the first sort. The roots of the integrands are groups of the canonical ...