On Sun, Dec 29, 2019 at 05:40:09PM -0800, Neil Girdhar wrote: > I'm just glancing at this thread, but it sounds like you want to add the > quickselect algorithm to the standard library. As you point out in > another message, quickselect is faster than quicksort: it is linear time > (provided the pivot is chosen by median of medians) whereas quicksort is > expected linearithmic time.
See https://bugs.python.org/issue21592 -- Steven _______________________________________________ Python-ideas mailing list -- python-ideas@python.org To unsubscribe send an email to python-ideas-le...@python.org https://mail.python.org/mailman3/lists/python-ideas.python.org/ Message archived at https://mail.python.org/archives/list/python-ideas@python.org/message/HU6YBQUTFWSRSL66LDT6R24VD4MKS3ZB/ Code of Conduct: http://python.org/psf/codeofconduct/
