Advanced algorithm and data structure library in C++
-
Updated
Oct 4, 2020 - C++
Advanced algorithm and data structure library in C++
Advance data structure includes DSU, BIT, SQRT Decomposition, Segment Tree, Lazy Propagation, Trie Tree etc.
This repository contains solutions of various classical problems on SPOJ.
Popular algorithms and data structures implementation
This repository contains the code of segment tree with lazy propogation to ans and update range queries in O(log(n)) time.
Segment tree with lazy propagation written in go
Segment Tree based on Lazy Propogation
Tiny neo4j in go for exploring data-centric laziness
High-performance generic segment tree and lazy segment tree implementations in Rust for efficient range queries, range updates, and interval operations. Supports custom monoid operations with zero-cost abstractions.
Add a description, image, and links to the lazy-propagation topic page so that developers can more easily learn about it.
To associate your repository with the lazy-propagation topic, visit your repo's landing page and select "manage topics."