Quote:
Originally posted by Theodoric
Then there's Theodoric's first law of supermarket shopping.
If n = the number of people at a checkout and d = the number of available dividers, then d < n - 1, except for the special case of n = 1, when d approaches infinity.
|
Not to mention the fact that the longest queue moves fastest, except for the special case where you're in the longest queue.