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

Replace iterator/sort with iterator/quickSort? #19

Open
jussi-kalliokoski opened this issue Jun 15, 2015 · 0 comments
Open

Replace iterator/sort with iterator/quickSort? #19

jussi-kalliokoski opened this issue Jun 15, 2015 · 0 comments

Comments

@jussi-kalliokoski
Copy link
Owner

Should be perf-tested whether there are any cases where the native implementation of the sorting algorithm significantly outperforms the self-hosted version. If not, quickSort should be deprecated and the algorithm used in sort. That way, the performance will also be more predictable and the algorithm deterministic (the self-hosted version uses first element as pivot so it's referentially transparent).

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

1 participant