qsort: add benchmarks for partially ordered data#78
Merged
peterdemartini merged 1 commit intomainfrom May 10, 2022
Merged
Conversation
Contributor
|
Ran on amd64, similar results: |
achille-roussel
approved these changes
May 9, 2022
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
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.
Often times sorting algorithms/implementations perform differently depending on the cardinality or pre-existing order on the data. I added benchmarks that take partially sorted data as the input. The results ended up showing that the standard library sorting version performs better than the asm version.
The benchmark results below are ran on my 2021 Apple M1 Pro w/ 16GB RAM machine