Randomized Algorithms
Jump to navigation
Jump to search
External
Internal
Overview
TODO CLRS page 114.
Enforcing a probability distribution on inputs ensures that no particular input always causes poor performance.
Probabilistic Analysis
Examples
- Karger's Contraction Algorithm
- Quicksort
- primality testing
- hashing