Let L be a list of 1024 distinct elements. Suppose L is sorted using a comparison-based algorithm. In the worst case, what is the minimum number of key comparisons to sort 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.