On Jan 27, 3:54 pm, Paul Rubin <no.em...@nospam.invalid> wrote: > Steven D'Aprano <ste...@remove.this.cybersource.com.au> writes: > > always much better written with key rather than cmp: key adds an O(N) > > overheard to the sorting, while cmp makes sorting O(N**2). > > Whaaaaaaaaaa ...... ???? No I don't think so.
You're referring to the O(N**2) bit, right? I am sure he knew it was O (N*log(N)), which is still worse than O(N) for key. If he didn't, well, Python has some fundamental flaws in its basic sort algorithm. -- http://mail.python.org/mailman/listinfo/python-list
