Referring to Problem 10, suppose that the items are not equally likely to be requested but have known probabilities p1, p2, . . . , pn. Suggest an alternative searching procedure that will decrease the average number of items that must be searched through, and show that in fact it does so.
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.