(computing) A search procedure which involves generating and checking all possible scenarios.

(computing theory) A method for parsing mathematical expressions specified in infix notation.

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

plural of Bellman-Ford algorithm

(computing theory) A multiplication algorithm that multiplies large integers by recursively splitting them into smaller parts and performing operations on the parts.

A common recursive fast Fourier transform algorithm.

(computing theory) An asymptotically fast recursive multiplication algorithm for large integers.

(computer graphics) An algorithm for generating heightmaps. It starts with a two-dimensional grid and then randomly generates terrain height from four seed values arranged in a grid of points so that the entire plane is covered in squares.

(computer graphics) An algorithm used for line clipping. It divides a two-dimensional space into nine regions (or a three-dimensional space into 27 regions), and then efficiently determines the lines and portions of lines that are visible in the central region, or viewport.

(computer science, graph theory) An algorithm for finding shortest paths in a weighted graph with positive or negative edge weights (but with no negative cycles).