Randomized algorithm:
A randomized algorithm is a technique that uses a source of randomness as part
of its logic. It is typically used to reduce either the running time, or time
complexity, or the memory used, or space complexity, in a standard algorithm.
Randomized algorithm can be categorized
into two classes:
(i) The first is
algorithms that always produce the same output for the same input. These are
called las vegas algorithms.
(ii) The second is
algorithms where outputs might differ from run to run. These are called Monte
carlo algorithms.
No comments:
Post a Comment