Cubesort
 | The topic of this article may not meet Wikipedia's general notability guideline. (September 2014) |
 |
| Class | Sorting algorithm |
|---|---|
| Data structure | Array |
| Worst-case performance | O(n log n) |
| Worst-case space complexity | Θ(n) |
Cubesort is a parallel sorting algorithm that builds a self-balancing multi-dimensional array from the keys to be sorted. As the axes are of similar length the structure resembles a cube. After each key is inserted the cube can be rapidly converted to an array.[1]
A cubesort implementation written in C was published in 2014.[2]
Operation[edit]
Cubesort's algorithm uses a specialized binary search on each axis to find the location to insert an element. When an axis grows too large it is split. Locality of reference is optimal as only four binary searches are performed on small arrays for each insertion. By using many small dynamic arrays the high cost for insertion on single large arrays is avoided.
References[edit]
- ^ Cypher, Robert; Sanz, Jorge L.C (1992). "Cubesort: A parallel algorithm for sorting N data items with S-sorters". Journal of Algorithms. 13 (2): 211–234. doi:10.1016/0196-6774(92)90016-6.
- ^ Igor van den Hoven (22 June 2014). "Cubesort". codeproject.com.
External links[edit]
- "Cubesort description and implementation in C". Archived from the original on 2020-10-08.
- Niedermeier, Rolf (1996). "Recursively divisible problems". Algorithms and Computation. Lecture Notes in Computer Science. Vol. 1178. Springer Berlin Heidelberg. pp. 187–188. doi:10.1007/BFb0009494. eISSN 1611-3349. ISBN 978-3-540-62048-8. ISSN 0302-9743. (passing mention)
 | This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it. |