deque vs list: performance notes
David C. Ullrich
ullrich at math.okstate.edu
Wed May 31 17:10:37 EDT 2000
Michael Hudson <mwh21 at cam.ac.uk> wrote in article
<m3og5myepf.fsf at atrus.jesus.cam.ac.uk>...
> david_ullrich at my-deja.com writes:
>
> > You sure about that "n!"? Seems more like n^2 to me.
> > (Of course n^2 is big, but n! would be much worse. It's
> > a theorem that n! is bigger than anything.)
>
> n^n is worse than n!, if you're after really bad algorithmic
> performance.
Thanks, and btw remind me to find the <g> key on that new
keyboard at the office.
I once had some kids in "discrete II" who actually _did_
think n! was bigger than anything, believe it or not. (Seriously,
n! is worse than anything that's gonna happen with a couple
nested loops...)
DU
> Cheers,
> Michael
>
> --
> Programming languages should be designed not by piling feature on
> top of feature, but by removing the weaknesses and restrictions
> that make the additional features appear necessary.
> -- Revised(5) Report on the Algorithmic Language Scheme
>
More information about the Python-list
mailing list