Skip to content

Commit 9cf376a

Browse files
authored
Remove extra parenthesis
1 parent 52f8db2 commit 9cf376a

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

src/data_structures/fenwick.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -12,7 +12,7 @@ Denote $f$'s infix notation as $*$; that is, $f(x,y) = x*y$ for arbitrary intege
1212

1313
The Fenwick tree is a data structure which:
1414

15-
* calculates the value of function $f$ in the given range $[l, r]$ $\left(\text{i.e. }A_l * A_{l+1} * \dots * A_r)\right)$ in $O(\log N)$ time
15+
* calculates the value of function $f$ in the given range $[l, r]$ (i.e. $A_l * A_{l+1} * \dots * A_r$) in $O(\log N)$ time
1616
* updates the value of an element of $A$ in $O(\log N)$ time
1717
* requires $O(N)$ memory (the same amount required for $A$)
1818
* is easy to use and code, especially in the case of multidimensional arrays

0 commit comments

Comments
 (0)