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.

Sign up for GitHub

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

Jump to bottom

Does Franceschini's method really need an auxiliary array of the length N? #1

Open
dumblob opened this issue Jun 16, 2021 · 0 comments
Open

Does Franceschini's method really need an auxiliary array of the length N? #1

dumblob opened this issue Jun 16, 2021 · 0 comments

Comments

@dumblob
Copy link

dumblob commented Jun 16, 2021

It seems this Java implementation needs an auxiliary array of the length of input. Is it really necessary? If I'm not mistaken, the paper actually says it shall sort in place.

Could you shed some light on that?

Btw. do you have any performance comparison to e.g. tuned quick sort written in Java? Could you post some preliminary benchmarks in the Readme of this repo?
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@dumblob