O(n^2) is bad - can it be fixed?

Courageous jkraska1 at san.rr.com
Thu May 24 12:13:56 EDT 2001

>What you're saying is theoretically true.  In practice, very few people
>run into the non-O(n) nature of lists, because the constant factor for
>expansion is large enough and other operations tend to swamp the list
>resize time.

The dispatch time from Python-to-C alone is enough to mask plenty
of time.


More information about the Python-list mailing list