June 2010
Intermediate to advanced
328 pages
7h 51m
English
The inefficiency of the sort-by-random solution is tolerable if your data set is bound to be small. For example, you could use a random method for assigning a programmer to fix a given bug. It’s safe to assume that you’ll never have so many programmers that you need to use a highly scalable method for choosing a random person.
Another example could be selecting a random U.S. state from a list of the 50 states, which is a list of modest size and not likely to grow during our lifetimes.
Read now
Unlock full access