Binary Indexed Tree, or Fenwick Tree
· ☕ 2 min read · 🦂 Kyle
BIT can be used to compute the prefix sum of an array in $log(n)$ time and takes only $O(n)$ space.
BIT can be used to compute the prefix sum of an array in $log(n)$ time and takes only $O(n)$ space.