A minimal but extreme fast B+ tree indexing structure demo for billions of key-value storage
-
Updated
Jan 4, 2023 - C
A minimal but extreme fast B+ tree indexing structure demo for billions of key-value storage
Library of generic and type safe containers in pure C language (C99 or C11) for a wide collection of container (comparable to the C++ STL).
Real-Time ASCII Art Rendering Library
C library of key-value data structures.
Implementation of various Data Structures and algorithms - Linked List, Stacks, Queues, Binary Search Tree, AVL tree,Red Black Trees, Trie, Graph Algorithms, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Segment Trees etc.
This library provides various containers. Each container has utility functions to manipulate the data it holds. This is an abstraction as to not have to manually manage and reallocate memory.
My variant of the C Template Library
Like tree but interactive
This repository contains some data structures implementation in C programming language. I wrote the tutorial posts about these data structures on my personal blog site in Bengali language. If you know Bengali then visit my site
🔗 Common Data Structures and Algorithms
Static Radix Tree (Patricia trie) implementation in C
https://gitlab.com/mildlyparallel/pscircle visualizes Linux processes in a form of radial tree.
Creating your own shell
Harbol is a collection of data structure and miscellaneous libraries, similar in nature to C++'s Boost, STL, and GNOME's GLib but for C99+
Add a description, image, and links to the tree topic page so that developers can more easily learn about it.
To associate your repository with the tree topic, visit your repo's landing page and select "manage topics."