Editing Las Vegas algorithm (section)

== Example ==
<syntaxhighlight lang="java" line="1">
// Las Vegas algorithm, assuming A is array of length n.
n = A.length
repeat:
    k = RandInt(n)
    if A[k] == 1,
        return k;
</syntaxhighlight>

As mentioned above, Las Vegas algorithms always return correct results. The code above illustrates this property. A variable ''k'' is generated randomly; after ''k'' is generated, ''k'' is used to index the array ''A''. If this index contains the value 1, then ''k'' is returned; otherwise, the algorithm repeats this process until it finds 1. Although this Las Vegas algorithm is guaranteed to find the correct answer, it does not have a fixed runtime; due to the randomization (in ''line 3'' of the above code), it is possible for arbitrarily much time to elapse before the algorithm terminates.