On Sun, Mar 5, 2017 at 8:29 PM Nick Timkovich <prometheus...@gmail.com> wrote:
> I see the benchmarks, and while I assume the asymptotic complexity is the > same, is there a longer "start-up" time your optimizations need? Do you > have benchmarks where you sort 10, 100...10**6 items to show that beyond > the types you're sorting, you're not amortizing any increased overhead out > to oblivion? > This is addressed in my post to the bug tracker with a perf benchmark (link in the first email in this thread). In short: the pre-sort check is really cheap, even for tiny lists. Though it gets cheaper (percent-wise) as you get bigger. You could also trivially modify the benchmark script I linked to in my original post to check for this.
_______________________________________________ Python-ideas mailing list Python-ideas@python.org https://mail.python.org/mailman/listinfo/python-ideas Code of Conduct: http://python.org/psf/codeofconduct/
