Prove that when running quicksort on an array with N distinct items, the probability of comparing the i th and j th smallest items is 2 / (j — i + 1). Then use this result to prove proposition k.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.