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

Insert benchmarking for rtree. #5

Open
hypirion opened this issue Oct 1, 2013 · 0 comments
Open

Insert benchmarking for rtree. #5

hypirion opened this issue Oct 1, 2013 · 0 comments

Comments

@hypirion
Copy link
Owner

hypirion commented Oct 1, 2013

Comparing the roulette tree to the linked list and array list implementation would be valuable, because the performance increase is asymptotic. Exactly when the roulette tree becomes faster may be interesting to figure out through benchmarking.

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