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

Even with 512 items buffer it's not fast enough #1

Open
Mrrl opened this issue Apr 29, 2014 · 1 comment
Open

Even with 512 items buffer it's not fast enough #1

Mrrl opened this issue Apr 29, 2014 · 1 comment

Comments

@Mrrl
Copy link
Owner

Mrrl commented Apr 29, 2014

GrailSortWithBuffer() beats std::stable_sort() only at array length of 10 millions or less (at 1 million it's 4/3 times faster, but at 100 millions 10% slower).

@Mrrl
Copy link
Owner Author

Mrrl commented Apr 30, 2014

Fixed some error (with block size selection). Now in the good case (many different keys) sorting is 1.3 times faster even on 100M array.

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

No branches or pull requests

1 participant