Randomized Algorithms
Use randomness for simplicity or expected speed: randomized quicksort, hashing, Monte Carlo methods.
Advanced
Las Vegas algorithms are always correct (random time); Monte Carlo ones are fast with a small error probability.
Spotted a mistake or want to add detail? Suggest an improvement — Content Contributors' edits are reviewed by editors before they go live.
Discussion (0)
Sign in or join free to ask questions and discuss this topic.