NIST

randomized algorithm

(definition)

Definition: Any algorithm that makes random (or pseudorandom) choices.

Generalization (I am a kind of ...)
algorithm.

Specialization (... is a kind of me.)
Monte Carlo algorithm, Las Vegas algorithm, skip list insert, randomized binary search tree, reservoir sampling.

See also adversary, pseudo-random number generator, probabilistic algorithm, deterministic algorithm.

Note: From Algorithms and Theory of Computation Handbook, pages 10-17 and 15-21, Copyright © 1999 by CRC Press LLC. Appearing in the Dictionary of Computer Science, Engineering and Technology, Copyright © 2000 CRC Press LLC.

Some algorithms make random choices initially to avoid any fixed worst case.

Author: CRC-A


Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 14 January 2009.
HTML page formatted Fri Feb 23 10:06:08 2018.

Cite this as:
Algorithms and Theory of Computation Handbook, CRC Press LLC, 1999, "randomized algorithm", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 14 January 2009. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/randomizedAlgo.html