Algorithm (nonfiction): Difference between revisions
Jump to navigation
Jump to search
No edit summary |
|||
| Line 1: | Line 1: | ||
In [[Mathematics (nonfiction)|mathematics]] and [[Computer science (nonfiction)|Computer science]], an '''algorithm''' is a self-contained step-by-step set of operations to be performed. | [[File:Euclid's_algorithm.svg|thumb|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 (nonfiction)|mathematics]] and [[Computer science (nonfiction)|Computer science]], an '''algorithm''' is a self-contained step-by-step set of operations to be performed. | ||
== In the News == | == In the News == | ||
Revision as of 14:19, 27 November 2016
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
External links:
- Algorithm @ Wikipedia