Consider a dynamic partitioning scheme. Show that, on average, the memory contains half as many holes as segments.
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.