In our median-finding algorithm (Section 2.4), a basic primitive is the split operation, which takes as input an array S and a value ν and then divides S into three sets: the elements less than ν, the elements equal to ν, and the elements greater than ν. Show how to implement this split operation in place, that is, without allocating new memory.
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.