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

Binary Heap: Extract Max seems wrong: O(n log(n)) #5

murraycu opened this Issue Feb 15, 2016 · 1 comment


None yet
1 participant

murraycu commented Feb 15, 2016 lists the average time complexity of Extract Max for a Binary Heap as O(n log(n)), but it should apparently be O(log(n), as it is on and in wikipedia:

The other time complexities for binary heap seem wrong too. And for Binomial Heap too, I think,

@murraycu murraycu changed the title from Binary Tree: Extract Max seems wrong: O(n log(n)) to Binary Heap: Extract Max seems wrong: O(n log(n)) Feb 24, 2016


This comment has been minimized.

murraycu commented Feb 24, 2016

Incidentally, this seems to be correct on

bleppard added a commit to bleppard/bigoref that referenced this issue Sep 21, 2017

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