I Kt just occurred to me: Even though l.sort() is sorting a presorted array, it still must be doing 10000-1 RichCompares minimum, just like max. So how do we explain the large difference?
> -----Original Message----- > From: [EMAIL PROTECTED] > [mailto:[EMAIL PROTECTED] On Behalf > Of Antoine Pitrou > Sent: Wednesday, October 22, 2008 14:06 > To: python-dev@python.org > Subject: Re: [Python-Dev] heapq, min and max > > Kristján Valur Jónsson <kristjan <at> ccpgames.com> writes: > > timeit.Timer("(l.sort(), l[-1])", > > s).timeit(1000) > > > > 0.29406761513791935 > > This is clearly wrong. l.sort() will sort the list in place when it is > first > invoked, and therefore will be very fast in subsequent calls. > _______________________________________________ Python-Dev mailing list Python-Dev@python.org http://mail.python.org/mailman/listinfo/python-dev Unsubscribe: http://mail.python.org/mailman/options/python-dev/archive%40mail-archive.com
