Memory-effficient immutable collection types for Kotlin
-
Updated
Nov 12, 2024 - Kotlin
Memory-effficient immutable collection types for Kotlin
Go package ordered sets implemented with balanced binary search trees
generic, fast lookup on one dimensional intervals. The implementation is based on treaps, augmented for intervals. Treaps are randomized self balancing binary search trees.
C++ implementations of real time dynamic planar convex hull construction algorithms.
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.
Algorithms + Data Structures implementation & key concepts (e.g., Recursion, DP, Greedy Algo, Randomization, Treaps, Hashing, Network Flow, Linear Programming, and Approximation)
100+ algorithms & data structures generically implemented in C#
A REST API application to simulate a p2p network with a tree topology.
C library of key-value data structures.
Most of the problems I solved and algorithms I grinded while prepairing for the Russian Olympiad in Informatics.
All about RMQ LCA
Experimenting with Treap Data Structure
Add a description, image, and links to the treaps topic page so that developers can more easily learn about it.
To associate your repository with the treaps topic, visit your repo's landing page and select "manage topics."