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

Faster priority queue implementation #10

Open

tbvanderwoude opened this issue Aug 5, 2024 · 0 comments

Labels

Owner

tbvanderwoude commented Aug 5, 2024 •

edited

Loading

Currently a binary heap is used. Alternatives include a pairing heap or a radix heap. This could bring insertion cost down from Θ(log n) to Θ(1)

tbvanderwoude added the enhancement label

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