(computer graphics) An algorithm that identifies which points (pixels) should be set in order to draw a straight line between two points.

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

A step-by-step procedure, like an algorithm, but which is not guaranteed to halt on all inputs.

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

(computing theory) An algorithm for finding the contiguous subarray within a one-dimensional numeric array which has the largest sum.

(graph theory) An algorithm that finds a number of shortest paths (allowing cycles) connecting a given pair of vertices in a digraph.

(computing theory) An algorithm for transforming a given set of generators for a polynomial ideal into a Gröbner basis with respect to some monomial order.

(computing) A variant of the Fisher-Yates shuffle that generates uniformly distributed cycles of some maximal length n, rather than permutations of the entire sequence.

Alternative form of Warnock algorithm

(computer graphics) An algorithm that solves the problem of rendering a complicated image by recursive subdivision of a scene until areas are obtained that are trivial to compute.