Article: Fenwick Tree

Problem:
Would you support a rewrite of the article to introduce 1-based indexing first? I believe this would simplify the exposition a lot (it did for me). That's also how Fenwick introduces it in his original paper https://web.archive.org/web/20160307203033/http://olds.blogcn.com/wp-content/uploads/67/6754/2009/01/bit.pdf
Apparently the getsum index operation i -= i & -i can also be written i &= i-1

Btw, wikipedia says the BIT was first introduced by Boris Ryabko in 1989, but I can't actually read it (and it doesn't have nice diagrams) https://web.archive.org/web/20190717074430/http://boris.ryabko.net/dan1989.pdf (English https://boris.ryabko.net/[ryabko1992.pdf](https://boris.ryabko.net/ryabko1992.pdf))