Prove that in the array P in procedure PERMUTE-BY-SORTING, the probability that all elements are unique is at least 1‒1/n.
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.