Cool. How does this compare to Pairing heaps or Fibonacci heaps?
Those heaps have O(log n) for delete-min (dequeue), this one has constant time for every operation, but as I said in the article, it has limitations.
O(log n)
A Heap has to move some values around after a delete is done, as in here, you only have to popup from a queue.
Are you sure you want to hide this comment? It will become hidden in your post, but will still be visible via the comment's permalink.
Hide child comments as well
Confirm
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
Cool. How does this compare to Pairing heaps or Fibonacci heaps?
Those heaps have
O(log n)for delete-min (dequeue), this one has constant time for every operation, but as I said in the article, it has limitations.A Heap has to move some values around after a delete is done, as in here, you only have to popup from a queue.