Cubesort
Jump to navigation
Jump to search
 | The topic of this article may not meet Wikipedia's general notability guideline. (September 2014) (Learn how and when to remove this template message) |
 | This article relies too much on references to primary sources. (September 2014) (Learn how and when to remove this template message) |
| 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". doi:10.1016/0196-6774(92)90016-6. Missing or empty
|url=(help) - ^ "Cubesort".
External links[edit]
- Cubesort description and implementation in C
- Algorithms and Computation: 7th International Symposium, ISAAC '96, Osaka ... edited by Tetsuo Asano et al, pp 187-188, https://books.google.com/books?id=vilOl8JCpFUC&pg=PA188&lpg=PA188&hl=en&f=false (passing mention)
 | This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it. |
