(definition)
Definition: Any algorithm that makes some 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.
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
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:06 2006.
Cite this as:
Algorithms and Theory of Computation Handbook, CRC Press LLC, 1999, "randomized 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/randomizedAlgo.html
