design and analysis of algorithms for cs2251

ning techniques to eliminate suboptimal solutions early Used in combinatorial optimization problems Randomized Algorithms Concept: Use randomness as part of the algorithm to achieve good average performance. Examples: Randomized QuickSort Monte Carlo a