1 Mar
2000
1 Mar
'00
6:34 a.m.
On Wed, Mar 01, 2000 at 11:43:49AM -0800, Aaron Christopher Finney wrote:
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...
There's a nice graphical demo of 3 different sort algorithms at
http://java.sun.com/docs/books/tutorial/essential/threads/index.html
--
_______ http://www.bigfoot.com/~ecloud
(_ | |_) ecloud(a)bigfoot.com finger rutledge(a)cx47646-a.phnx1.az.home.com
__) | | \__________________________________________________________________
Join the ProcessTree Network: For-pay Internet distributed processing.
http://www.ProcessTree.com/?sponsor=5903