Jump to content

Las Vegas algorithm

From Simple English Wikipedia, the free encyclopedia
Revision as of 05:31, 29 December 2006 by Az1568 (talk | changes) (Reverted edits by Ur muvva innit to last version by 84.163.212.109)

A Las Vegas algorithm is an algorithm. It uses randomness, but does not touch whether the result is corrent or not. However, it gambles with the resources used.

A simple example would be a version of the QuickSort algoritm. Quicksort is used to quickly sort things (mostly numbers). For this, each element is compared to a central element (called pivot). Depending on how this element is selected the sorting can take more time or less.

Most often, a Las Vegas alogrithm is used to pick the pivot randomly.