Comments on: What Heaps Can Do That Priority Queues Don’t

By: Jonathan Boccara

Jonathan Boccara — Sun, 15 Apr 2018 13:39:00 +0000

In reply to Malcolm Parsons. Thanks for sharing Malcolm!

By: Malcolm Parsons

Malcolm Parsons — Fri, 13 Apr 2018 16:29:00 +0000

I iterate over a subset of a binary heap without using a queue:


    size_t nextIndex(const vector& data, size_t n, bool allow_down)
    {
        if (allow_down) {
            // try down
            if (n * 2 + 1 < data.size()) {
                return n * 2 + 1;
            }
        }
        while (n) {
            // try sibling
            if (n & 1 && n + 1 < data.size()) {
                return n + 1;
            }
            // go up
            n = (n - 1) / 2;
        }
        return n;
    }

By: Jonathan Boccara

Jonathan Boccara — Tue, 27 Mar 2018 06:58:00 +0000

In reply to Andrew Starikov. Yes! I've fixed it now, thanks Andrew.

By: Andrew Starikov

Andrew Starikov — Mon, 26 Mar 2018 14:38:00 +0000

“resp. writeChild” -> “resp. rightChild” ?