Burstsort and its variants are cache-efficient algorithms for sorting strings. They are variants of the traditional radix sort but faster for large data...

the heap data structure. This can be useful for certain data types, see burstsort. IBM 80 series Card Sorters Other distribution sorts Kirkpatrick-Reisch...

algorithm Extendible hashing Hash array mapped trie Prefix hash tree Burstsort Luleå algorithm Huffman coding Morin, Patrick. "Data Structures for Strings"...

character, which replaces the hash bucket node as the trie root (e.g. see Burstsort). The existing keys and values contained in the hash bucket are each shortened...

the assumption that n ≪ 2k, but the algorithm does not require this. Burstsort — n ⋅ k d {\displaystyle n\cdot {\frac {k}{d}}} n ⋅ k d {\displaystyle...

a form of radix sort. Tries are also fundamental data structures for burstsort, which is notable for being the fastest string sorting algorithm as of...

lists Slowsort Strand sort Non-comparison sorts Bead sort Bucket sort Burstsort: build a compact, cache efficient burst trie and then traverse it to create...