This repository is a workshop for heap allocator implementations using a variety of data structures and algorithms. The goal is to compare performance and tradeoffs of different approaches in depth.
python c cmake makefile binary-search-tree red-black-tree heap terminal-based clrs runtime-analysis coalescing splay-tree heap-allocator first-fit-algorithm best-fit-algorithm segregated-fits
-
Updated
Apr 6, 2024 - C