Raymond Hettinger <raymond.hettin...@gmail.com> added the comment:
> python2's implementation of randrange() that uses random() > under the hood was noticeably faster than python3's > randrange() that uses getrandbits() under the hood. Yes, that was a conscious decision. See https://bugs.python.org/issue9025 . We traded performance in order to gain correctness. As noted in the docs: "Changed in version 3.2: randrange() is more sophisticated about producing equally distributed values. Formerly it used a style like int(random()*n) which could produce slightly uneven distributions." ---------- _______________________________________ Python tracker <rep...@bugs.python.org> <https://bugs.python.org/issue43040> _______________________________________ _______________________________________________ Python-bugs-list mailing list Unsubscribe: https://mail.python.org/mailman/options/python-bugs-list/archive%40mail-archive.com
