Assertion: algorithm's time | /r/HasProperty | finite
Facets:
Source sentences:
text: An algorithm is guaranteed to terminate and produce a result, always stopping after a finite time.
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.