Clip

Using Random Sampling to Design Algorithms
listen on Spotify
1:24:09 - 1:30:13 (06:04)

The ability to draw random numbers from a range or associate a random number with an object is crucial in designing algorithms such as the Fermat's Little Theorem for identifying prime numbers or counting the number of solutions that satisfy a particular formula in propositional logic using a random sampling idea.

Similar Clips