Stable sort with Θ(n log log n) time complexity
I’m trying to solve this problem:
Is the following problem solvable by bucket sort or is it more complex than that?
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.