(C. A. R. Hoare) Let L be a list of size n. Quicksort can be used to find the kth smallest item in L, where 0 ≤ k ≤ n − 1, without completely sorting L. Write and implement a C++ function, kThSmallestltem, that uses a version of quicksort to determine the k th smallest item in L without completely sorting L.
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.