Algorithm (nonfiction)

From Gnomon Chronicles
Revision as of 20:16, 15 January 2018 by Admin (talk | contribs)
Jump to navigation Jump to search
Flow chart of an algorithm (Euclid's algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≥ A yields "yes" (or true) (more accurately the number b in location B is greater than or equal to the number a in location A) THEN, the algorithm specifies B ← B − A (meaning the number b − a replaces the old b). Similarly, IF A > B, THEN A ← A − B. The process terminates when (the contents of) B is 0, yielding the g.c.d. in A.

In mathematics and Computer science, an algorithm is a self-contained step-by-step set of operations to be performed.

In the News

Fiction cross-reference

Nonfiction cross-reference

Publications:

  • Numerical Recipes - a series of books on algorithms and numerical analysis by William H. Press, Saul A. Teukolsky, William T. Vetterling and Brian P. Flannery. In various editions, the books have been in print since 1986. The most recent edition was published in 2007.

On the web: numerical.recipes.

External links: