by stefanwebb
Copy-Burstsort is a sorting algorithm for strings that is cache-efficient. Burstsort and its variants are much faster than Quicksort and Radixsort especially on large datasets. Copy-Burstsort works best for sorting short strings such as genomes and words
Improvements to this version: 1. Uses C++ standard library instead of C standard library. 2. No memory leaks. 3. Supports variable alphabet through templates. 4. Faster than Burstsort 1.0. 5. Code is easier to read, removed debug lines.
Burstsort is a library for sorting strings, and is currently the fastest algorithm for doing so, being much faster than Quicksort and Radix sort. It has applications to computational linguistics, genomics, and many other areas of science where sorting ...
Burstsort is a library for sorting strings, and is currently the fastest algorithm for doing so, being much faster than Quicksort and Radixsort. It has applications to computational linguistics, genomics, and many other areas of science where sorting ...
Copyright © 2009 SourceForge, Inc. All rights reserved. Terms of Use