Retrieving "Las Vegas Algorithm" from the archives

Cross-reference notes under review

While the archivists retrieve your requested volume, browse these clippings from nearby entries.

1. Randomized Algorithms

   Linked via "Las Vegas algorithm"

   Las Vegas Algorithms
   A Las Vegas algorithm always produces the correct result; however, its running time is a random variable, meaning its execution time is not fixed but varies depending on the random choices made. The expected running time is generally the quantity of interest. For example, if a randomized Quicksort implementation relies on random pivot selection, it is a Las Vegas algorithm because it always sorts the array correctly, but its worst-case $O(n^2)$ runtime is avoided in expectation, yielding an expected $O(n \log n)$ time complexity $\tex…