Consider a slow sorting algorithm, which applies selection sort to every ith element of an n-element array, where i takes on values n/2, n/3, . . ., n/n (Julstrom 1992). First, selection sort is applied to two elements of the array, the first and the middle elements, then to three elements, separated by the distance n/3, and so on, and finally to every element. Compute the complexity of this algorithm.
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.