Various data structures supported by a no heap splay tree written in C.
-
Updated
Jun 13, 2024 - C
Various data structures supported by a no heap splay tree written in C.
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).
This section of the repository serves as a comprehensive exploration of a wide range of data structures and algorithms. From the foundational arrays to the complexities of graphs and trees, with a commitment to clarity, depth, and practicality, this repository is designed to be your go-to resource for mastering data structures and algorithms.
Basic data structures in C: list, set, map/hashtable, queue... (libstdc++ wrapper)
sorted key/value storage for C99
My variant of the C Template Library
🔬 BEDOPS: high-performance genomic feature operations
This repo provides C implementations for various different data structures that are commonly employed in programming. I based the choice of structures roughly off of those which I learned in my data structures course at Caltech. To challenge myself, I wanted to see if I could implement these structures in C rather than Java resulting in this repo
individual c utility libraries
Multithreaded Mandelbrot set with xlib on c.
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.
This is a c project. The user will insert characters and create 2 differents sets (S and T). Then a series of messages will appear, showing: The 2 sets, if they are equal or one of them is a subset of the other, their union, their intersection and their difference.
GSet library is a C library to manipulate polymorphic sets of data.
Add a description, image, and links to the set topic page so that developers can more easily learn about it.
To associate your repository with the set topic, visit your repo's landing page and select "manage topics."