Which of the following is a disadvantage of cube sort?
(a) high memory overhead for small data
(b) high memory overhead for any data
(c) balancing is slow
(d) Iteration is slow
I have been asked this question in an international level competition.
My question comes from Sorting topic in division Sorting of Data Structures & Algorithms II