Given an array A with n elements such that each element contains a key (an integer) and additional satellite
data. The array contains exactly k unique key values.
- Assume that k ∈ Θ(log n). Describe a stable sorting algorithm that sorts A with a run time complexity
of Θ(n log log n)
I have something in mind using bucket sort but I’m unsure whether it fits the description.
New contributor
CR7 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.