News for hackers. Stuff that matters.

A comment on An interesting data structure with search time O(sqrt n). Parent comment

Re:An interesting data structure with search time O(sqrt n) by AYBABTME on Monday November 30, 2015 @09:01PM (#10653235)
You'd re-heapify all heaps greater than the one that ejected an element, since heaps greater than you are all full except for the very last one.
[ Parent | on HN ]
Re:An interesting data structure with search time O(sqrt n) by deciplex on Monday November 30, 2015 @09:16PM (#10653286)
I said that:

> Then you would insert the max you just removed into the next heap in the same way, and so on.

[ Parent | on HN ]