Cubesort
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. A cubesort implementation written in C was published in 2014.
Link from a Wikipage to another Wikipage
primaryTopic
Cubesort
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. A cubesort implementation written in C was published in 2014.
has abstract
Cubesort is a parallel sorting ...... en in C was published in 2014.
@en
Link from a Wikipage to an external page
Wikipage page ID
43,835,553
page length (characters) of wiki page
Wikipage revision ID
906,978,048
Link from a Wikipage to another Wikipage
class
optimal
?
@en
wikiPageUsesTemplate
hypernym
type
comment
Cubesort is a parallel sorting ...... en in C was published in 2014.
@en
label
Cubesort
@en