IntX is a C++11 port of IntX arbitrary precision Integer library with speed, about O(N * log N) multiplication/division algorithms implementation.

A simple go library - Log management for Go 🪵

A Fibonacci min / max heap implementation, written in Go

Will cover Data Structures and algorithms related codes written in C++.

Complete functional BTree with efficient data insertion/searching/removal with real time data manipulations

A weighted random item sampler (selector), where the probability of selecting an item is proportional to its weight, and every item is sampled exactly once (without repetition or replacement). The sampling method utilizes a binary-search optimization, making it suitable for performance-demanding applications where the set of items is large.

An implementation of a generic Heap data structure using an ArrayList. Standard functions of a heap included.

A key value storage engine where memtable is implemented using AVL Trees.