A Fenwick /Binary Indexed Tree Implementation

Правка en1, от ameya, 2018-06-12 23:37:33

Hey everyone,
I've recently implemented a Fenwick Tree (probably better known a Binary Indexed Tree or a BIT) supporting range-based and point-based sum queries as well as updates, in C++ 14.
The approach was inspired by Petr's blog here!
The implementation is available on github here under fenwicktree.hpp.
Any comments and suggestions are welcome!

Теги #data structure, bit/fenwick tree

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский ameya 2018-06-12 23:37:33 542 Initial revision (published)