39. Randomized algorithms and probabilistic data structures
Use randomness to make computation faster, smaller, or more robust. Hashing, Bloom filters, sketches, randomized trials, and concentration bounds show how probability supports real software systems.