-
Notifications
You must be signed in to change notification settings - Fork 50
Use counting sort to sort in linear instead of quadratic time #243
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.
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
Use counting sort to sort in linear instead of quadratic time #243
Conversation
mandolaerik
commented
Nov 24, 2023
- remove unused method
- Use counting sort to sort in linear instead of quadratic time
|
This is a simpler alternative to #239: almost as fast (4ns instead of 2ns per field for getting the sorted fields), and no memory footprint. Thanks to Love for suggesting this approach. |
|
Verification #12567253: fail |
|
Verification #12570225: pass |
lwaern-intel
left a comment
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
see my comments for my follies. Microoptimization is hard, who knew.
2e72a47 to
c70aa88
Compare
|
Verification #12592898: pass |