How to demonstrate bigO cost of algorithms?

Matt matt at themattfella.zzzz.com
Thu Jun 3 05:29:58 CEST 2004


Rusty Shackleford wrote:

> All help is welcome.

For quicksort, you should see ((n log(n))/runtime(n)) approach some 
constant as you increase n.




More information about the Python-list mailing list