Jump to content

Algorithms (journal)

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Andre Engels (talk | contribs) at 16:07, 6 April 2001. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

An algorithm is the description of a procedure to solve a certain (mathematical) problem. Typically, an algorithm consists of a series of actions that have to be done plus an indication of whether and when they are to be repeated. One could see an algorithm as a rough form of a computer program.


The word algorithm is a corruption of the word algorism which came from the name of Abu Ja'far Mohammed ibn Musa al-Khwarizmi (ca. 780 - ca. 850). He was the author of the book "Kitab al-jabr w'al-muqabala" (Rules of Restoration and Reduction) which introduced algebra to people in the West. The word algebra itself originates from al-Jabr from the book title. The word alogorism orignally referred only to the rules of performing arithmetic using Hindu-Arabic numerals, but evolved into "algorithm" by the eighteenth century. The word has nowadays evolved to include all definite procedures for solving problems, including cooking :)


As an example of an algorithm, here is an algorithm, brought to us by Euclid, and thus known as the Euclidean Algorithm, for finding the greatest common divisor (ggd) of two natural numbers A and B:


  1. Let A be the greatest number of A and B, and B the smallest.
  1. Subtract B from A.
  1. Repeat steps 1 and 2 until A and B are equal, this number will then be the greatest common divisor of the original numbers.

Related topics:

Cryptographic algorithms:

  1. Symmetric Algorithms
  1. Asymmetric Algorithms