Cubesort

From Wikipedia, the free encyclopedia

Template:Short description

Page Module:Message box/ambox.css has no content.Page Template:Multiple issues/styles.css has no content.

Page Module:Infobox/styles.css has no content.

Cubesort
ClassSorting algorithm
Data structureArray
Worst-case performanceO(n log n)
Worst-case space complexityΘ(n)
Optimal?

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

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

Page Template:Reflist/styles.css has no content.

  1. ^ Page Module:Citation/CS1/styles.css has no content.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.
  2. ^ Page Module:Citation/CS1/styles.css has no content.Igor van den Hoven (22 June 2014). "Cubesort". codeproject.com.[dead link]

Lua error in package.lua at line 80: module 'Module:Navbox/configuration' not found.

Template:Asbox