Slashdot Mirror

← Back to Stories (view on slashdot.org)

Sort Linked Lists 10X Faster Than MergeSort

Posted by kdawson on from the out-of-sorts dept.

virusfree tells us about a new algorithm that has been developed that the author claims can sort a linked list up to 10 times faster than MergeSort. "BitFast," a member of the Hash algorithms family, is available in C and C++ under the GPL.

3 of 326 comments (clear)

  1. Radix Sort by doopokko · · Score: 0, Redundant

    How is this different from Radix sort?

  2. Almost accurate. by imbaczek · · Score: 0, Redundant

    This isn't sorting linked lists, it's sorting linked list of NUMBERS (or, more specifically, N-bit strings.) Doing that fast is hardly rocket science, and this bitfast is nothing new... That's basically radixsort with radix = 2^16.

  3. Re:It's radix sort. by Bozzio · · Score: 0, Redundant

    I wish I had mod points!

    +1 Funny

    --
    I just pooped your party.