Analysis, Implementation and Applications of Fenwick Trees
-
Updated
Sep 15, 2018 - C++
Analysis, Implementation and Applications of Fenwick Trees
Data structures of particular interest to me
Graph-Theory, Number-Theory, Classical Dynamic Programming, Searching-Sorting Algorithms and some Advance-Data-Structures are implemented using C++
A deque of O(sqrt n) complexity on access, insert and remove, with an optimization for O(log n) access based on fenwick tree.
Popular algorithms and data structures implementation
Algorithms useful for CS graduates
Advance data structure includes DSU, BIT, SQRT Decomposition, Segment Tree, Lazy Propagation, Trie Tree etc.
Here are solutions from problems that i coded for my assignment, preparing for competitions. They are sorted by some criteria, like DP, greedy, ad hoc, etc.
This project implements the **Binary Indexed Tree** with template. It can obtain the prefix sum in O(log N) time, add or update one item in O(log N) time, random-access in O(1) time. At the same time, we provide a **random access iterator** of the prefix sum. The iterator can interact well with many STL algorithms.
In this project, we aim to implement Fenwick Trees to compute sub-matrix operations.
My LeetCode solutions while practicing
Add a description, image, and links to the binary-indexed-tree topic page so that developers can more easily learn about it.
To associate your repository with the binary-indexed-tree topic, visit your repo's landing page and select "manage topics."