15 results for “topic:treaps”
100+ algorithms & data structures generically implemented in C#
C library of key-value data structures.
Advanced algorithms and data structures for competitive programming and computational research: LA/LCA, RMQ, perfect hashing, vEB/x-fast trees, treaps, and suffix automata/tree implementations.
C++ implementations of real time dynamic planar convex hull construction algorithms.
Memory-effficient immutable collection types for Kotlin
generic, fast lookup on one dimensional intervals. The implementation is based on treaps, augmented for intervals. Treaps are randomized self balancing binary search trees.
Most of the problems I solved and algorithms I grinded while prepairing for the Russian Olympiad in Informatics.
All about RMQ LCA
This implementation puts a twist on the Standard Treap (randomized search tree) in the sense that I add the idea of self-organizing data structures on top, To implement a Database (collection of rows that are somehow related) Indexing.
No description provided.
Go package ordered sets implemented with balanced binary search trees
A REST API application to simulate a p2p network with a tree topology.
Experimenting with Treap Data Structure
No description provided.
A library that I am working on, a generic abstract data structure library for C/C++ utilising void pointers.