Reference for BURSTSORT. Search for BURSTSORT

AI searches containing BURSTSORT

BURSTSORT

Burstsort

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

Burstsort

Radix sort

Non-comparative lexicographical sorting algorithm

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

Radix sort

Radix_sort

Radix tree

Data structure

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

Radix tree

Radix_tree

Trie

Search tree data structure

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

Trie

HAT-trie

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

HAT-trie

Sorting algorithm

Algorithm that arranges lists in order

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

Sorting algorithm

Sorting_algorithm

List of algorithms

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

List of algorithms

List_of_algorithms