[Solved]1096 Given N Numbers Number Distinct Values 21 Log2n Devise Comparison Based Algorithm Sor Q37158518

[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 loglog n) time? Explain why the lower bound of 2(n log n) for sorting n numbers does not apply in this case

Expert Answer

---

Answer to [1096] Given n numbers such that the number of distinct values is only 21 log2n devise a comparison-based algorithm to s… . . .