How to demonstrate bigO cost of algorithms?

Matt matt at themattfella.zzzz.com
Wed Jun 2 23:29:58 EDT 2004

Previous message (by thread): How to demonstrate bigO cost of algorithms?
Next message (by thread): How to demonstrate bigO cost of algorithms?
Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

Rusty Shackleford wrote:

> All help is welcome.

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

Previous message (by thread): How to demonstrate bigO cost of algorithms?
Next message (by thread): How to demonstrate bigO cost of algorithms?
Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

More information about the Python-list mailing list