(definition)

**Definition:**
An *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:
Appearing in Dictionary of Computer Science, Engineering and Technology, Phillip A. Laplante ed., 2001, CRC Press LLC. *

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

Author: PEB

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 28 February 2019.

HTML page formatted Wed Mar 13 12:42:46 2019.

Cite this as:

Paul E. Black, "randomized algorithm", in
*Dictionary of Algorithms and Data Structures* [online], Paul E. Black, ed. 28 February 2019. (accessed TODAY)
Available from: https://www.nist.gov/dads/HTML/randomizedAlgo.html