Raymond Hettinger [EMAIL PROTECTED] added the comment:
Thanks for the thoughtful reply. Am going to close for the reasons
agreed by most of the respondants. See additional explanation in the
closing of issue 1451588 .
That all-at-once action of sort() allows it to take advantage of a
Jeffrey C. Jacobs [EMAIL PROTECTED] added the comment:
Thanks Raymond for checking on the status of this issue and Guido for
thinking about it too. I still support the basic concept for the
reasons I specified in the original description, namely maintaining a
sorted list (or random-access
Raymond Hettinger [EMAIL PROTECTED] added the comment:
Guido, what do you think about this one?
It is easy to do and has been requested several times in various forums.
The seeming reasonable basis for the request is that sort and bisect
should fit together like a nut and bolt -- it is somewhat
Guido van Rossum [EMAIL PROTECTED] added the comment:
Sorry, I will claim ignorance on this one. I don't recall the last time
I've used a bisection, but it was probably around the time bisect.py was
first added to the standard library. I do recall using heap sort as a
way to compute the top N
