Analysis, Implementation and Applications of Fenwick Trees
-
Updated
Sep 15, 2018 - C++
Analysis, Implementation and Applications of Fenwick Trees
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.
A repository made to store files regarding my EE which discusses whether or not an array is a subarray of another array.
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.
Useful datastructures not present in standard Python libraries
Popular algorithms and data structures implementation
Data Structures naively implemented in Kotlin for learning purpose
Volume Computation of 3D Reconstructed Objects From Volumetric Data Using Binary Indexed Tree
Fenwick Tree (a.k.a. Binary Indexed Tree) using typescript+redis
Binary Indexed Tree
Data structures of particular interest to me
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.
Pseudo Multiset using Binary Indexed Tree implemented in Python.
In this project, we aim to implement Fenwick Trees to compute sub-matrix operations.
HackerRank Counting Inversions using binary indexed trees
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."