Collection of data structures examples via Java
Welcome to the CP Vault, I've created this repository for competitive programming resources and notes. This collection covers a wide range of topics like dynamic programming, analyzing time complexity on constraints, algorithms, data structures, and more. It’s a personal vault designed to help you excel in advanced concepts and problem-solving.
Advance data structure includes DSU, BIT, SQRT Decomposition, Segment Tree, Lazy Propagation, Trie Tree etc.
Data Structures naively implemented in Kotlin for learning purpose
Algorithms useful for CS graduates
An implementation of Fenwick trees (Fenwick 1994).
Analysis, Implementation and Applications of Fenwick Trees
A deque of O(sqrt n) complexity on access, insert and remove, with an optimization for O(log n) access based on fenwick tree.
Binary Indexed Tree
Popular algorithms and data structures implementation
A Fenwick Tree, Also Known as a Binary Indexed Tree (BIT), is a Specialised Data Structure Designed for Efficiently Handling Two Types of Operations on an Array of Numbers
Detailed explanation of Binary Indexed Tree (Fenwick Tree) with C++ implementation.
45 Days DSA Challenge with Arsh Goyal
Graph-Theory, Number-Theory, Classical Dynamic Programming, Searching-Sorting Algorithms and some Advance-Data-Structures are implemented using C++
Fenwick trees (BIT) and a lazy-propagation segment tree in pure Standard ML — persistent prefix/range sums, cumulative search, range-add/range-sum; dual-compiler (MLton + Poly/ML).
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.
To associate your repository with the binary-indexed-tree topic, visit your repo's landing page and select "manage topics."