What is Las Vegas algorithm?
A '''Las Vegas algorithm''' is an [[algorithm]] that uses [[random]]ness which has the consequence that the algorithm terminates with the probability <math>p<1</math>. If the algorithm does terminate then it does so with a correct result (unlike a [[Monte Carlo algorithm]] which definitely terminates but with a result that is only correct with the probability <math>p<1</math>). The algorithm [[gambling|gambles]] with the [[resource]]s used. It may take a very long times to give back a result, or it may not give back a result at all. A simple example would be a version of the [[Quicksort]]. 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 algorithm is used to pick the pivot randomly. [[Category:Randomised algorithms]] [[Category:Game theory]] {{Tech-stub}}