Hi Weng,
Sorry to say, but the REAL answer is The Best Sorting Algorithm
depends always on WHAT you're sorting, AND on what it's current
sortedness state is.
For instance, say you're program's task is to add a few names or
records into a large set of data, like a college directory. That
Hi Adak,
I agree with some of your points but I do disagree with others.
For clarity, I'll snip your comments inline below. Note: when I
refer to quicksort, I am including its variants such as
introsort/ternary
quicksort etc.
Sorry to say, but the REAL answer is The Best Sorting Algorithm
Hi Adak,
Your comments are appreciated.
After reading Knuth's 3rd volume: Sorting and Searching carefully
many years ago, I thought which sorting algorithm is best is resolved.
But recently I read the following papers, I think there should be
someone over there to do a real computations to
But the above case is more about hashing than sorting, really.
And hey, my potato peeler can do that too! (^: (okay, bad joke).
The above example is also refered to as the postman's sort, I
believe.
- Michael
--~--~-~--~~~---~--~~
You received this message
Used to be in separate static RAM (really fast), chips, but the algo's
they used were the same one's they use today. Thankfully, the cache's
today are larger. Sure that helps. How much this helps each sorting
algorithm, I just couldn't say. The pivot in Quicksort is (hopefully)
held in a register
Hi everyone,
Please continue this discussions and I want to see the best algorithm
for sorting in the world today. If possible, give some performance
index.
Thank you.
Weng
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google
This is taken from Wikipedia, under Quicksort:
This close fit with modern architectures makes quicksort one of the
fastest sorting algorithms on average. Because of this excellent
average performance and simple implementation, quicksort has become one
of the most popular sorting algorithms in
I am biased toward Quicksort, simply because it has proven itself the
best sorter I've ever seen, in test after test, after test.
Interesting stuff! I wonder if you guys realize you can even implement
quicksort to be very efficient on _singly linked lists_. I figured
this out years ago, but
Look at introspective sorting - a rather old algorithm.
And look at the book Programming Pearls - (J. Bentley). There is a chapter on Data structures programs.
And apologies if you already knew about both things (in which case, the above two sentences would sound offensive).
sincerely,
mayur
