Search Results for ""

A prime factorization algorithm.

A q-analog of Zeilberger's algorithm.

The Euclidean algorithm, also called Euclid's algorithm, is an algorithm for finding the greatest common divisor of two numbers a and b. The algorithm can also be defined for ...

The number of single operations (of addition, subtraction, and multiplication) required to complete an algorithm.

The complexity of a pattern parameterized as the shortest algorithm required to reproduce it. Also known as bit complexity.

A spigot algorithm is an algorithm which generates digits of a quantity one at a time without using or requiring previously computed digits. Amazingly, spigot algorithms are ...

Numerical stability refers to how a malformed input affects the execution of an algorithm. In a numerically stable algorithm, errors in the input lessen in significance as ...

A shuffling algorithm used in a class of random number generators.

The Floyd-Warshall algorithm, also variously known as Floyd's algorithm, the Roy-Floyd algorithm, the Roy-Warshall algorithm, or the WFI algorithm, is an algorithm for ...

A searching algorithm which works on a sorted table by testing the middle of an interval, eliminating the half of the table in which the key cannot lie, and then repeating ...