Stats
Implementations
Cube Sort is a parallel-friendly sorting algorithm that generalizes comparison-based sorting by arranging elements into a multidimensional cube structure, sorting along each dimension iteratively. It is mainly of theoretical and educational interest.
Paradigm
Parallel / Multidimensional
Author
Researchers / Academic Literature
Tier
CTime Complexity
Best
O(n log n)Avg
O(n log n)Worst
O(n log n)Space
O(n)Properties