Line of code takes 12 seconds off runtime.#2
Open
ahitt6345 wants to merge 2 commits intobellbind:masterfrom
Open
Line of code takes 12 seconds off runtime.#2ahitt6345 wants to merge 2 commits intobellbind:masterfrom
ahitt6345 wants to merge 2 commits intobellbind:masterfrom
Conversation
Apparently, this tim sort keeps merging uneven runs. Adding this code makes sure it prioritizes Even Runs. I ran this timsort(before edit) on 1000000 Integers. It took a whopping 12 SECONDS vs. The normal merge sort's 0.5 seconds. Now, it's run time is improved to 0.9 seconds.
Owner
|
I want to apply it, but the project as the document code, it should not applied the last code only. |
Author
|
Then you should apply the code to all the documents that use the stack. |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Apparently, this tim sort keeps merging uneven runs. Adding this code makes sure it prioritizes Even Runs. I ran this timsort(before edit) on 1000000 Integers in a random order. It took a whopping 12 SECONDS vs. The normal merge sort's 2 seconds. Now, it's run time is improved to 0.9 seconds.