On Aug 02, 2006, at 10:46 PM, Charles Yeomans wrote:
The idea of quicksort is extremely simple. But the direct
implementations of it are toy sorts, not suitable for real use.
It's quite tricky to do a real implementation, and apparently minor
changes can kill performance. Once you get it working, then of
course there isn't so much to maintain, so perhaps it's more
accurate to say that it's hard to get working. You can see the
difference in my SortLibrary code; compare the insertion sort code
to the quicksort code.
Charles Yeomans
And some of the optimizations that you can do to make quicksort run
quicker do add to overall algorithm complexity.
One that comes to mind is not using quicksort to sort sublists
smaller than a certain size.
Or median of 3 partitioning.
Neither are part of the original quicksort algorithm but are
additions that improve performance but add to overall complexity.
_______________________________________________
Unsubscribe or switch delivery mode:
<http://www.realsoftware.com/support/listmanager/>
Search the archives of this list here:
<http://support.realsoftware.com/listarchives/lists.html>
