 |
|
| ||||||||||||||||||||||||||
|
|
| ||||||||||||||||||||||||||
|
|
|
|
|
| ||||||||
In computing, a Las Vegas algorithm is a randomized algorithm which is correct (always outputs the correct answer). So the only variation is the running-time. An alternative definition additionally includes the restriction, that the average-case running-time must be finite.
|
||||
| View Live Article | This article is from Wikipedia. All text is available under the terms of the GNU Free Documentation License | |
||
