![[1096] Given n numbers such that the number of distinct values is only 21 log2n devise a comparison-based algorithm to sort t](https://media.cheggcdn.com/media%2F6e8%2F6e8858e2-a445-43aa-b7b8-71c015160311%2FphpA2idGQ.png)
[1096] Given n numbers such that the number of distinct values is only 21 log2n devise a comparison-based algorithm to sort these numbers in O(n loglog n) time? Explain why the lower bound of 2(n log n) for sorting n numbers does not apply in this case Show transcribed image text [1096] Given n numbers such that the number of distinct values is only 21 log2n devise a comparison-based algorithm to sort these numbers in O(n
OR
OR