Files
cpython/Lib
Tim Peters 657fe38241 Large code rearrangement to use better algorithms, in the sense of needing
substantially fewer array-element compares.  This is best practice as of
Kntuh Volume 3 Ed 2, and the code is actually simpler this way (although
the key idea may be counter-intuitive at first glance!  breaking out of
a loop early loses when it costs more to try to get out early than getting
out early saves).
Also added a comment block explaining the difference and giving some real
counts; demonstrating that heapify() is more efficient than repeated
heappush(); and emphasizing the obvious point thatlist.sort() is more
efficient if what you really want to do is sort.
2002-08-03 09:56:52 +00:00
..
2002-07-23 20:35:58 +00:00
2002-07-18 19:48:46 +00:00
2002-06-11 06:22:31 +00:00
2002-03-17 21:49:20 +00:00
2001-12-22 15:23:50 +00:00
2001-08-09 12:33:32 +00:00
2002-08-03 02:17:41 +00:00
2002-02-11 17:56:27 +00:00
2002-06-13 17:59:51 +00:00
2002-06-01 01:29:16 +00:00
2002-07-25 16:10:38 +00:00
2002-07-16 21:35:23 +00:00
2002-06-01 16:07:16 +00:00
2001-08-02 07:15:29 +00:00
2002-06-01 16:07:16 +00:00
2002-05-23 23:58:17 +00:00
2002-07-16 21:35:23 +00:00
2002-06-02 00:40:05 +00:00
2002-06-02 00:40:05 +00:00
2001-10-28 20:15:40 +00:00
2002-07-16 21:35:23 +00:00
2002-02-08 20:41:34 +00:00
2002-05-23 15:15:30 +00:00
2002-05-31 14:15:11 +00:00
2002-07-16 21:35:23 +00:00
2002-03-18 13:06:00 +00:00
2002-04-13 14:03:38 +00:00
2002-07-16 21:35:23 +00:00