Talk:Burstsort

Could someone please supply some more information? I.e.
 * How does it work?
 * What is a Trie?
 * How does a Burst Trie work and what it is?

--84.61.73.134 16:25, 11 July 2007 (UTC)
 * Tried to add more information for you. SoutherD 23:47, 28 October 2007 (UTC)

First sentence: "Burstsort and its variants are cache-efficient algorithms for sorting strings and are faster than quicksort and radix sort for large data sets."

This cannot be true as radix sort has running time O(k*n) and burst sort has running time O(n log n). For small k, radix sort is thus faster. --Profetylen (talk) 18:34, 10 December 2011 (UTC)


 * I'm removing radix sort from that sentence. --Profetylen (talk) 13:43, 16 December 2011 (UTC)