SOLUTION: Let min and max be the smallest and largest numbers among a large set of n distinct numbers arranged uniformly at random. Suppose we run quicksort on those n numbers.
A. The two n
Algebra ->
Probability-and-statistics
-> SOLUTION: Let min and max be the smallest and largest numbers among a large set of n distinct numbers arranged uniformly at random. Suppose we run quicksort on those n numbers.
A. The two n
Log On
Question 1042554: Let min and max be the smallest and largest numbers among a large set of n distinct numbers arranged uniformly at random. Suppose we run quicksort on those n numbers.
A. The two numbers min and max will be compared with probability close to 1.
B. The two numbers min and max will be compared with probability equal to 1/2.
C. The two numbers min and max will be compared with probability close to 0.
D. The two numbers will never be compared. Answer by ikleyn(52752) (Show Source):
