Merge pull request #1318 from Zyad-Ayad/patch-1

adamant-pwn · web-flow · commit 25e51948a972 · 2024-10-12T02:31:37.000+02:00
Update fenwick.md
diff --git a/src/data_structures/fenwick.md b/src/data_structures/fenwick.md
@@ -121,9 +121,9 @@ h(31) = 63 &= 0111111_2 \\\\
 
 Unsurprisingly, there also exists a simple way to perform $h$ using bitwise operations:
 
-$$h(j) = j ~\|~ (j+1),$$
+$$h(j) = j ~|~ (j+1),$$
 
-where $\|$ is the bitwise OR operator.
+where $|$ is the bitwise OR operator.
 
 The following image shows a possible interpretation of the Fenwick tree as tree.
 The nodes of the tree show the ranges they cover.
