A Monte Carlo algorithm runs in a deterministic amount of time, and computes a probabilistic (approximate) result. For example: Monte Carlo numerical integration, or Miller-Rabin primality testing.
A Las Vegas algorithm takes a non-deterministic amount of time, but is guaranteed to return a correct result. For example: quicksort with a random choice of pivot.
Let's say you want to simulate a 1/3-biased coin with a fair coin.
One solution is to flip the fair coin twice, then output heads if you get HH, output tails if you get TH or HT, otherwise retry (if TT).
Then this process is guaranteed to always output heads with 1/3 probability and tails with 2/3 probability if it ever ends. The runtime complexity is unbounded since you can keep getting TT forever but the expected runtime is constant.
The expectation is a stranger and more dangerous beast than would be easily expected.
Because it might sort faster or slower depending on how the pivot gets picked. But you'd get the sorted list in the end. A Monte Carlo solution might run for 5 seconds but you might get a partially sorted list only.
Monte Carlo = Probably Correct, Always Fast
- Las Vegas: Correct, Time unbounded
- Monte Carlo: Not always correct, Time bounded
edit: format
Edit: TIL that they are different. (Thanks for the explanations below! esp: gmfawcett and 1001101)