Welcome, Guest! Log In | Create Account

Share

Burstsort

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


http://burstsort.sourceforge.net

Algorithms

Project Feed

  • burstsort 2.0 source file released: Burstsort-2.0-source.zip

    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.

    10:41PM on Aug 04 2007

  • Burstsort 2.0 Released!

    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 ...

    12:49PM on Aug 04 2007 by stefanwebb

  • Burstsort 1.0 Released!

    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 ...

    03:56PM on May 29 2007 by stefanwebb

  • burstsort 1.0 source file released: Burstsort-1.0-source.zip

    
                
            
            

    04:48PM on May 26 2007

Burstsort Actions