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.

8 of 326 comments (clear)

  1. Re:Radix Sort by Anonymous Coward · · Score: 5, Funny

    How is this different from Radix sort?

    Marketing.

  2. Re:FROTHY PISS by Anonymous Coward · · Score: 5, Funny

    No.
    You are an "HTML programmer".
    An oxymoron and a moron, simultaneously.
    Defenestrate yourself.

  3. That doesn't matter! by Anonymous Coward · · Score: 5, Funny

    This was written by VirusFree! Who wouldn't want to use something by a guy named VirusFree? It's a million times better than something by FreeVirus.

    1. Re:That doesn't matter! by ScrewMaster · · Score: 4, Funny

      No difference ... he's just saying that you can have his Virus ... Free.

      --
      The higher the technology, the sharper that two-edged sword.
  4. You're making the baby Knuth cry by aprosumer.slashdot · · Score: 5, Funny

    You're making the baby Knuth cry. Please read "The Art of Computer Programming" before proceeding any further.

  5. Re:How is this not a radix sort? by Sillygates · · Score: 4, Funny

    My favorite is still: http://www.dangermouse.net/esoteric/intelligentdes ignsort.html

    Sorts in O(1) and uses no memory!

    --
    I fear the Y2038 bug
  6. Re:It's radix sort. by rosscoe · · Score: 4, Funny

    Wow, he uses the new 33bit ints as well, enabling numbers twice as high as the so-old-school 32bit ints and making it just that 'little bit' better.

  7. Re:It's radix sort. by Lon · · Score: 5, Funny

    my sort goes to 11 ... wait, that is only three :(