(mathematics) a standard procedure for solving a class of mathematical problems

an algorithm for sorting a list

an algorithm for removing inflectional and derivational endings in order to reduce word forms to a common stem

a method for solving problems in linear programming that tests adjacent vertices of the feasible set in sequence so that at each new vertex the objective function improves or is unchanged. [##P: The simplex algorithm begins at a starting vertex and moves along the edges of the polytope until it reaches the vertex of the optimum solution.]

In computer science and cryptography, a cryptographic hash function.

(computing) a search procedure using techniques modelled on the biological theory of natural selection.