We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 195a1cd commit 34ebf06Copy full SHA for 34ebf06
src/data_structures/fenwick.md
@@ -70,7 +70,7 @@ The function `sum` works as follows:
70
71
The function `increase` works with the same analogy, but it "jumps" in the direction of increasing indices:
72
73
-1. Sums of the range $[g(j), j]$ which satisfy the condition $g(j) \le i \le j$ are increased by `delta`; that is, `t[j] += delta`.
+1. The sum for each range of the form $[g(j), j]$ which satisfies the condition $g(j) \le i \le j$ is increased by `delta`; that is, `t[j] += delta`.
74
Therefore, it updates all elements in $T$ that correspond to ranges in which $A_i$ lies.
75
76
The complexity of both `sum` and `increase` depend on the function $g$.
0 commit comments