Randomization - Data Structures and Problem Solving Using Java - page 393

chapter 9

randomization

M any situations in computing require the use of random numbers. For
example, modern cryptography, simulation systems, and, surprisingly, even
searching and sorting algorithms rely on random number generators. Yet good
random number generators are difficult to implement. In this chapter we discuss
the generation and use of random numbers.
In this chapter, we show

How random numbers are generated

n

How random permutations are generated

n

How random numbers allow the design of efficient algorithms, using
a general technique known as the randomized algorithm

n

why do we need
random numbers?

9.1

Random numbers are used in many applications. In this section we discuss a
few of the most common ones.