Multipurpose C library and persistent key/value storage

TypeScript & Javascript Data Structures

⚡️ Lock-free and wait-free concurrent data structures for Go (generics)

extra-collections (or extra for short) is a python3 package that provides a pythonic, intuitive, and easy implementation of the most common data structures used in software projects.

System Programming projects on Multiprocessing, Multithreading, FIFO Pipes, Network Sockets, Bash Scripting & building Data Structures

Basic data structures in C with useful comments and explanations

Simple LZSS+RLE+RC32 compression algorithm realization (C/C++/Rust/Go).

A complete LSM tree key-value storage engine written in Go. Implements SSTables, memtables, and write-ahead logging with a modern Wails and React desktop interface

Skip list implementation in OCaml

Various skip list implementations

Lock free, arena-backed skip list memtable for LSM storage engines.

Common engineering data structures and algorithms, such as linear,tree,linked list,graph,greedy,divide and conquer,dynamic programming, backtracking, depth search, breadth search and so on

Highly flexible worst-case O(log n) intrusive skip list

A Skip List is a Probabilistic Data Structure Allowing for Efficient Searching, Insertion, and Deletion of Elements Within a Sorted Sequence, Mostly used with Balanced Search Trees (AVL, Red-Black) Due to its Comparable Average-Case Performance (O log n)

Golang Advanced Data Structures

System for handling / tracking / updating / querying of vaccination data using advanced data structures (skip lists, bloom filters)

A lock-free concurrent skip list in Rust with hand-rolled epoch-based memory reclamation. Zero dependencies.

תירגולים ומימושים למבני נתונים ואלגוריתמים

Detailed explanations and implementations of some of my favorite specialized data structures and algorithms.

Generic skip list implemented from scratch in Java as a fully compliant SortedSet<T> — O(log n) insert, search, and delete. Tested at 10M elements.