×

Burstsort

Sorting algorithm
Burstsort and its variants are cache-efficient algorithms for sorting strings. They are variants of the traditional radix sort but faster for large data sets of common strings, first published in 2003, with some optimizing versions published in... Wikipedia
Worst-case complexity: n*k/d
Stable: No
Data structure: Trie
Worst-case performance: O(wn)