Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

try using powersort based merging for TimSort #69

Open
oscardssmith opened this issue Dec 14, 2022 · 1 comment
Open

try using powersort based merging for TimSort #69

oscardssmith opened this issue Dec 14, 2022 · 1 comment
Labels
new algorithm

Comments

@oscardssmith
Copy link
Member

python 3.11 added this in python/cpython#78742
@oscardssmith oscardssmith changed the title use powersort based merging for TimSort try using powersort based merging for TimSort Dec 14, 2022
@LilithHafner
Copy link
Member

This seems like a pretty clear win from the discussion on the Python side but a very minor performance gain. Here's the diff that implemented the changes in Python's C implementation.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
new algorithm
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
2 participants
@oscardssmith @LilithHafner