Grokking Fenwick Trees
jornhub.dev
Grokking Fenwick Trees
1–7 of 7 posts
Re: Grokking Fenwick Trees
#2To be fair to the original paper by Peter Fenwick, it is quite a clear and accessible paper by academic standards (but this article is still very welcome and even easier to follow).
I especially liked the technique for isolating the least significant set bit, and have sometimes wondered if there are any other places one might use it. Has anyone here ever used that trick in a different context?
Re: Grokking Fenwick Trees
#3I have no explanations but runnable code: https://www.nayuki.io/page/binary-indexed-tree
Re: Grokking Fenwick Trees
#4This is beautiful technical writing. I was crushed to discover that this was his first article (at this location).
Re: Grokking Fenwick Trees
#5This is beautiful technical writing. I was crushed to discover that this was his first article (at this location).
Thanks! What subjects do you care about?
Re: Grokking Fenwick Trees
#6This is beautiful technical writing. I was crushed to discover that this was his first article (at this location).
Thanks! What subjects do you care about?
Not the person you replied to, but how about suffix and least common prefix arrays? Once it clicks how they work they feel quite simple, but can still be quite tricky to grok until then.
Re: Grokking Fenwick Trees
#7This is beautiful technical writing. I was crushed to discover that this was his first article (at this location).
Thanks! What subjects do you care about?
Segment trees are cool, if that's not too similar to Fenwick for good content (they have some common uses).
Sqrt decomposition is a cool technique IMO too.
(I've been on a range-query kick recently).