1 Mar
2000
1 Mar
'00
5:43 a.m.
One of my early CS classes had us graph results of sorts and plot the
order of magnitude...quicksort and mergesort were fairly even, depending
on the "randomness" of the data, and were very close to n*logn on the
graph. There were a couple of other variants of recursive sorts as well,
but I've never really used anything but the basic quicksort in a real live
application...
On Wed, 1 Mar 2000, Dwight Elvey wrote:
CLASSICCMP(a)trailing-edge.com wrote:
Hi
Sorry, it was just a tease. I was hoping that many
would take out their QuickSort and find that there
500 MHz pentium couldn't compete with a 33 MHz DSP.
Actually, the algorithm I used is a kn+c unlike
QuickSort's k(n*logn) ( c is a constant time overhead ).
BubbleSort is really just an example of how to
use J and K in nested loops. BogoSort sounds like
the worst sort I've ever heard but I like it.
Dwight
If anyone
out there doesn't think sorting 1000 signed integers
in 6.8 millisecs isn't fast, code it up on your PC and
see how fast it is.
It depends a lot on the algorithm you use in the sort, of course :-).