How to demonstrate bigO cost of algorithms?

Matt matt at themattfella.zzzz.com
Wed Jun 2 22:32:02 EDT 2004


Rusty Shackleford wrote:

> I'm not getting the results I hoped for.  I expected that after the
> program is finished, I would get results near 
> 
>     len(ll) * math.log(len(ll), 2)
> 
> since the big O for quicksort is nlogn for all but the worst case.

Just what results are you getting?




More information about the Python-list mailing list