Sort Linked Lists 10X Faster Than MergeSort 326

Posted by kdawson on Sunday February 25, 2007 @03:43PM 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.

Comment Re:Why implicitly typed locals? (Score 1) 386

by darweidu on Sunday September 18, 2005 @08:22AM (#13588997) Attached to: Anders Hejlsberg on C# 3.0

You can, but what advantage is there? code in implicity typed languages (which includes the dynamically typed languages) is just as easy (if not easier to read). Eg: foo = 5.0f; bar = 18; baz = "what"; Would the "float", "int" and "String" types really added much to the understanding of the program?

« Newer Older »

Slashdot Top Deals

The faster I go, the behinder I get. -- Lewis Carroll