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

Implementation of smoothsort #7

Open
zerothi opened this issue Dec 14, 2016 · 0 comments
Open

Implementation of smoothsort #7

zerothi opened this issue Dec 14, 2016 · 0 comments

Comments

@zerothi
Copy link
Member

zerothi commented Dec 14, 2016

This sorting algorithm should be better than heap-sort for nearly-sorted arrays.

In cases where the array is partially sorted this may even be faster than quick-sort because there will be less moving of elements compared to quick-sort.
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
1 participant
@zerothi