Assertion: algorithm's input | /r/HasProperty | random
Facets:
Source sentences:
text: The transition from one state to the next is not necessarily deterministic; some algorithms, known as randomized algorithms, incorporate random input.
text: One has to distinguish between algorithms that use the random input so that they always terminate with the correct answer, but where the expected running time is finite (Las Vegas algorithms, for example Quicksort), and algorithms which have a chance of producing an incorrect result (Monte Carlo algorithms, for example the Monte Carlo algorithm for the MFAS problem) or fail to produce a result either by signaling a failure or failing to terminate.