(algorithmic technique)
Definition: An algorithm whose behavior can be completely predicted from the input.
See also nondeterministic algorithm.
Note: That is, each time a certain set of input is presented, the algorithm gives the same results as any other time the set of input is presented. For algorithms with state, or that maintain information between inputs, "the input" means everything since the algorithm was started from an initial state.
There can be degrees of deterministic behavior. For instance, an algorithm that uses random numbers might not be considered deterministic. However if the "random numbers" come from a pseudo-random number generator, the behavior may be deterministic.
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 17 December 2004.
HTML page formatted Mon Sep 11 09:46:02 2006.
Cite this as:
Paul E. Black, "deterministic algorithm", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 17 December 2004. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/determinalgo.html
