Collection of data structures examples via Java
-
Updated
Dec 9, 2018 - Java
Collection of data structures examples via Java
Advance data structure includes DSU, BIT, SQRT Decomposition, Segment Tree, Lazy Propagation, Trie Tree etc.
Analysis, Implementation and Applications of Fenwick Trees
Data Structures naively implemented in Kotlin for learning purpose
Algorithms useful for CS graduates
A deque of O(sqrt n) complexity on access, insert and remove, with an optimization for O(log n) access based on fenwick tree.
An implementation of Fenwick trees (Fenwick 1994).
My solutions synced by LeetHub while solving algorithmic problems on LeetCode.
Popular algorithms and data structures implementation
Volume Computation of 3D Reconstructed Objects From Volumetric Data Using Binary Indexed Tree
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.
Binary Indexed Tree
Graph-Theory, Number-Theory, Classical Dynamic Programming, Searching-Sorting Algorithms and some Advance-Data-Structures are implemented using C++
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.
A repository made to store files regarding my EE which discusses whether or not an array is a subarray of another array.
Useful datastructures not present in standard Python libraries
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."