summaryrefslogtreecommitdiff
path: root/datastructures/fenwickTree.cpp
diff options
context:
space:
mode:
authorPaul Jungeblut <paul.jungeblut@gmail.com>2015-12-03 01:13:09 +0100
committerPaul Jungeblut <paul.jungeblut@gmail.com>2015-12-03 01:13:09 +0100
commit460c5be29f39c62cb1842772ab305308a05b79ff (patch)
treec141c1b5c5eeb8b5670d0a405f202772ca48af48 /datastructures/fenwickTree.cpp
parent53e7f12d828bb94c05d2b6c4e04d61de9482c426 (diff)
parentfa3508ac4b96b39435ab8671412126fefc59bea8 (diff)
Merge in Fenwick Tree
Diffstat (limited to 'datastructures/fenwickTree.cpp')
-rw-r--r--datastructures/fenwickTree.cpp21
1 files changed, 21 insertions, 0 deletions
diff --git a/datastructures/fenwickTree.cpp b/datastructures/fenwickTree.cpp
new file mode 100644
index 0000000..02be7d4
--- /dev/null
+++ b/datastructures/fenwickTree.cpp
@@ -0,0 +1,21 @@
+vector<int> FT; //Fenwick-Tree
+
+//Build an Fenwick-Tree over an array a. Time Complexity: O(n*log(n))
+buildFenwickTree(vector<int>& a) {
+ n = a.size();
+ FT.assign(n+1,0);
+ for(int i = 0; i < n; i++) updateFT(i,a[i]);
+}
+
+//Prefix-Sum of intervall [0..i]. Time Complexity: O(log(n))
+int prefix_sum(int i) {
+ int sum = 0; i++;
+ while(i > 0) { sum += FT[i]; i -= (i & (-i)); }
+ return sum;
+}
+
+//Adds val to index i. Time Complexity O(log(n))
+void updateFT(int i, int val) {
+ i++; while(i <= n) { FT[i] += val; i += (i & (-i)); }
+}
+