By using this site, you agree to our updated Privacy Policy and our Terms of Use. Manage your Cookies Settings.
446,190 Members | 839 Online
Bytes IT Community
+ Ask a Question
Need help? Post your question and get tips & solutions from a community of 446,190 IT Pros & Developers. It's quick & easy.

Sorting Linked List - up to 10 times faster than merge sort

P: 1
hi guys,

i wrote an article about an algorithm i came up with,
(which actually is based on hash algorithms..)

and it's for sorting linked lists... (up to 10 times faster than mergesort on my pc)

here is the link to the [Link Removed]

i also have examples of this (the benchmarks actually) in C and C++
that you can download from there and test it for yourself

i want to know what you think

thanks,

Feb 25 '07 #1
Share this Question
Share on Google+
2 Replies


10K+
P: 13,264
Moved to C++ forum.
Feb 26 '07 #2

MMcCarthy
Expert Mod 10K+
P: 14,534
Links have been removed from original post as they point to another forum and this is against site rules. If you wish to get the algorithm reviewed in this forum you will have to post it here.

ADMIN
Feb 26 '07 #3

Post your reply

Sign in to post your reply or Sign up for a free account.