Algorithm, << AL guh rihth uhm, >> is a step-by-step procedure for solving a mathematical problem in a limited number of steps. The instructions for each step are precise. Many algorithms involve repeating the same steps several times and can be carried out by a computer.
Probably the most famous algorithm is Euclid’s algorithm. It is used to find the greatest common divisor of any two whole numbers, a and b. To use this algorithm, first divide the smaller number (b) into the larger number (a): a/b. If the numbers divide evenly, with a remainder (r) of 0, the algorithm ends and b is the answer. But if the remainder is not 0, divide the remainder into the former divisor: b/r. Keep dividing each succeeding remainder into the previous divisor until you reach a remainder of 0. Then stop. The last divisor is the greatest common divisor of the original numbers a and b.
See also Computer science .
