Fenwick Tree (Binary Indexed Tree)

A compact array that answers prefix-sum queries and point updates in O(log n) using the low-bit trick i & −i.