Scaled Fenwick Trees by Matthew Cushman

“…Computing sums of ranges of arrays of numbers is a common computational problem encountered in data compression, coding, machine learning, computational vision, and finance, among other fields. Efficient data structures enabling <inline-formula> <tex-math notation="LaTeX">$\log n$ </tex-math></inline-formula> updates of the underlying data (including range updates), queries of sums over ranges, and searches for ranges with a given sum have been extensively studied (<inline-formula> <tex-math notation="LaTeX">$n$ </tex-math></inline-formula> being the length of the array). …”
Get full text