Las Vegas algorithm

Please give us a THUMBS UP if you like our videos!!!
Source:http://en.wikipedia.org/wiki/Las_Vega...

In computing, a Las Vegas algorithm is a randomized algorithm that always gives
correct results; that is, it always produces the correct result or it informs
about the failure. In other words, a Las Vegas algorithm does not gamble with
the correctness of the result; it gambles only with the resources used for the
computation. A simple example is randomized quicksort, where the pivot is chosen
randomly, but the result is always sorted. The usual definition of a Las Vegas
algorithm includes the restriction that the expected run time always be finite,
when the expectation is carried out over the space of random information, or
entropy, used in the algorithm.