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.

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

Add Timsort #21

Open
2 tasks done
camilne opened this issue Apr 27, 2018 · 0 comments
Open
2 tasks done

Add Timsort #21

camilne opened this issue Apr 27, 2018 · 0 comments
Labels
algorithm This relates to an algorithm enhancement New feature or request

Comments

@camilne
Copy link
Owner

camilne commented Apr 27, 2018

Issue title

Add Timsort

Issue description

Timsort is an adaptive sorting algorithm that takes advantage of existing runs in a sequence to sort the data.

Details:
Best-case Time: O(n)
Average-case Time: O(n log n)
Worst-case Time: O(n log n)
Space: O(n)

Checklist

  • Check for existing issue
  • Check for existing pull request
@camilne camilne added enhancement New feature or request algorithm This relates to an algorithm labels Apr 27, 2018
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
algorithm This relates to an algorithm enhancement New feature or request
Projects
None yet
Development

No branches or pull requests

1 participant