(combination puzzles) An optimal algorithm that finds the solution with the fewest moves.

(graph theory, computing) An algorithm that computes single-source shortest paths in a weighted digraph, capable (unlike the faster Dijkstra's algorithm) of handling graphs with negative edge weights.

(graph theory) An algorithm that computes single-source shortest paths in a weighted digraph.

(computing theory) A quantum algorithm for finding the prime factors of an integer.

(computing) A randomized algorithm that always gives a correct result rather than merely giving a probably correct result.

A dynamic programming algorithm for finding the most likely sequence of hidden states (the Viterbi path) that results in a sequence of observed events.

Euclidean algorithm

(mathematics) A general-purpose integer factorization algorithm, particularly effective at splitting composite numbers with small factors.

An extension to the Euclidean algorithm, which computes the coefficients of Bézout's identity in addition to the greatest common divisor of two integers.

An algorithm for finding the minimum value in each row of an implicitly-defined totally monotone matrix.