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_at_bigfoot.com finger rutledge_at_cx47646-a.phnx1.az.home.com
__) | | \__________________________________________________________________
Join the ProcessTree Network: For-pay Internet distributed processing.
http://www.ProcessTree.com/?sponsor=5903
Received on Wed Mar 01 2000 - 14:34:13 GMT