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

TimSort #17

Open
3 tasks
evanplaice opened this issue Oct 30, 2019 · 0 comments
Open
3 tasks

TimSort #17

evanplaice opened this issue Oct 30, 2019 · 0 comments
Labels
algorithm feature New feature up-for-grabs

Comments

@evanplaice
Copy link
Member

evanplaice commented Oct 30, 2019 •
edited
Loading

TimSort is a lesser-known sorting algorithm that combines the best characteristics of Insertion Sort and MergeSort, depending on the size of the input.

Checklist

  • implementation
  • tests
  • jsdoc

Specifics

Notes

References

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

No branches or pull requests
1 participant
@evanplaice