How to demonstrate bigO cost of algorithms?
rs at overlook.homelinux.net
Wed Jun 2 19:05:02 CEST 2004
Thanks for that explanation -- it really helped. I forgot that O(n) can
translate into dn + c where d and c are constants.
I think I'm going to keep trying to figure out ways to demonstrate big O
stuff, because I just don't understand it until I see it in a
Give and take free stuff: http://freecycle.org
More information about the Python-list