We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
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
There is no stable sorting algorithm the current dotnet core base libraries.
Stable sorting algorithms maintain the relative order of records with equal keys.
Other languages have built in support for this: python - timsort java - timsort rust - timsort variant ( rust-lang/rust#38192 ).
I would propose a port of either java timsort or rust's enhanced algorithm.
Not only are they stable, they are highly performant.
The text was updated successfully, but these errors were encountered:
I couldn't figure out the best area label to add to this issue. If you have write-permissions please help me learn by adding exactly one area label.
Sorry, something went wrong.
See e.g. #60982 for a similar request.
Closing as duplicate.
No branches or pull requests
There is no stable sorting algorithm the current dotnet core base libraries.
Stable sorting algorithms maintain the relative order of records with equal keys.
Other languages have built in support for this:
python - timsort
java - timsort
rust - timsort variant ( rust-lang/rust#38192 ).
I would propose a port of either java timsort or rust's enhanced algorithm.
Not only are they stable, they are highly performant.
The text was updated successfully, but these errors were encountered: