Sort Linked Lists 10X Faster Than MergeSort
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.
Marketing.
No.
You are an "HTML programmer".
An oxymoron and a moron, simultaneously.
Defenestrate yourself.
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.
You're making the baby Knuth cry. Please read "The Art of Computer Programming" before proceeding any further.
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
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.
my sort goes to 11 ... wait, that is only three :(
The Art of Computer Programming, vol 3, Sorting and Searching, 1973, by Donald Knuth Page 173, Algorithm R - radix list sort. No credit is given. The algorithm has been well known and obvious since the first link list was invented. Hey! A good choice for a patent!
It's only March. There'll be an inventor of the internal combustion engine along shortly.
Maybe this guy has re-invented radix sort? I can't really tell! I wish somebody would post and tell me!
Pfft, everyone knows the best sort is random sort. Randomize the list. Is it sorted? If not, randomize it again! You'll hit it eventually!
"Destroy science and religion. Science would re-emerge exactly the same; but not religion." - Penn Jillette, paraphrased