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.

4 of 326 comments (clear)

  1. 10x? by Anonymous Coward · · Score: -1, Troll

    NO WAI. RLY?

    1. Re:10x? by Anonymous Coward · · Score: -1, Troll

      BUTTSECKS?

  2. I CODE HTML IN C++ by Anonymous Coward · · Score: -1, Troll

    PLUS TEH FORTRAN ASSMEBLY HOCUS POCUS

    Reason: Don't use so many caps. It's like YELLING.

    Reason: Don't use so many caps. It's like YELLING.

    Reason: Don't use so many caps. It's like YELLING.

  3. Re:wtf? seriously. by Paradise+Pete · · Score: 0, Troll
    Sixth, the headline "10X faster" is incorrect, as they differ asymptotically,

    And seventh, (and admittedly I'm really reaching here) the proper grammar for comparisons is "as fast," not "faster."
    "Faster" is not logically correct, as can be seen more easily when the two approach equality. If, for instance, 10 seconds is ten times faster than 100, then to be consistent 100 must be one times faster than 100, which is just plain silly.