binary-indexed-tree
There are 29 repositories under binary-indexed-tree topic.
AnghelLeonard/Java-Data-Structures
Collection of data structures examples via Java
cryptocode/zigwick
A Fenwick tree for Zig
shiningflash/Advance-Data-Structure
Advance data structure includes DSU, BIT, SQRT Decomposition, Segment Tree, Lazy Propagation, Trie Tree etc.
jemshit/DataStructures
Data Structures naively implemented in Kotlin for learning purpose
paras2411/Algorithms
Algorithms useful for CS graduates
ViktorSlavkovic/Fenwick
Analysis, Implementation and Applications of Fenwick Trees
dstein64/fenwick
An implementation of Fenwick trees (Fenwick 1994).
skyzh/data-structure-deque
A deque of O(sqrt n) complexity on access, insert and remove, with an optimization for O(log n) access based on fenwick tree.
HenryRLee/fenwick-tree
A C++ Fenwick Tree Library
jigyansunanda/Leetcode-Practice
My solutions synced by LeetHub while solving algorithmic problems on LeetCode.
codehub001/CrackYourInternship
45 Days DSA Challenge with Arsh Goyal
gevg/bit
Binary Indexed Tree
legolas-1/DS-Algo
Popular algorithms and data structures implementation
MatijaEskicWork/Algorithmic-Problems
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.
VISEF-ISEF-team/Volume-Computation
Volume Computation of 3D Reconstructed Objects From Volumetric Data Using Binary Indexed Tree
detel/Data-Structures
Some of the data structures useful for Competitive Programming
DimitrisJim/BIT
Binary Indexed (Fenwick) Trees
divyanshsr/2DFenwickTrees
In this project, we aim to implement Fenwick Trees to compute sub-matrix operations.
ihjohny/Algorithms-Implementation
Graph-Theory, Number-Theory, Classical Dynamic Programming, Searching-Sorting Algorithms and some Advance-Data-Structures are implemented using C++
j05u3/fenwick-tree-redis
Fenwick Tree (a.k.a. Binary Indexed Tree) using typescript+redis
jiasunzhu613/EE
A repository made to store files regarding my EE which discusses whether or not an array is a subarray of another array.
LiuZJ2019/BinaryIndexedTree_TemplateClass_And_Iterator
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.
mr4msm/pseudo_multiset
Pseudo Multiset using Binary Indexed Tree implemented in Python.
valginer0/exotic-structures
Useful datastructures not present in standard Python libraries
yutao-li/binary-indexed-tree
efficient construction of binary indexed tree
antonio-f/CountingInversions
HackerRank Counting Inversions using binary indexed trees
Resident234/data_structures
Data structures of particular interest to me