Posted by Freddie Paras on August 05, 1999 at 19:19:58:
In Reply to: graphs again posted by MtBiker on August 05, 1999 at 18:52:44:
: I did a comp vs N graph and a swap vs N graph, each
: with n=100 to 1k for every algorithm.
: Now how do we do the asymptotic fcn since that
: relates to runtime and we're graphing comps and swaps
: vs N?!?!?!?!?!?! It's irrelavent and moreover, I
: don't know what graph it should be included on!
When I made the graphs i just indicated the time
complexities right next to the sorting function's
name.