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

我设计了一种新型的排序算法，是一个改进型的桶排序，平均速度是快排的 3 倍，最快达到 20 倍，可以试试 #3

Closed
hackware1993 opened this issue Jun 4, 2022 · 2 comments
Closed

我设计了一种新型的排序算法，是一个改进型的桶排序，平均速度是快排的 3 倍，最快达到 20 倍，可以试试 #3

hackware1993 opened this issue Jun 4, 2022 · 2 comments

Comments

@hackware1993
Copy link

https://github.com/hackware1993/ChenSort
@hackware1993
Copy link
Author

Chen sort 是一个混合排序，如果将底层替换为 pdqsort，那它的速度也能达到 pdqsort 的三倍

@zhangyunhao116
Copy link
Owner

The Go version of pdqsort has been merged into Go runtime, we don't discuss algorithm differences in this repository, if you have a better sorting algorithm, maybe hacknews is a better place, Thanks!

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

No branches or pull requests
2 participants
@hackware1993 @zhangyunhao116