[issue46488] listsort.txt wrongly assumes you cannot calculate leading zeros in O(1) time.

[Barry Schwartz]

Barry Schwartz <github at crudfactory.com> added the comment:

Yes. Actually the issue is branching, not order of complexity, because looping at most 64 times is a linear-bounded operation. The methods I point out involve no branching! And so can be rather fast. I don't suggest they be used, but that the listsort.txt be revised.

----------

_______________________________________
Python tracker <report at bugs.python.org>
<https://bugs.python.org/issue46488>
_______________________________________