Reusable code for various data structures and algorithms in C. This repo is intended to give C programmers a library of generic data structures and algorithms that can be reused across projects, similar to STL.
The following data structures have been written:
binheap: Binary min-heap, implemented using a vector.htable: Hash table using linked lists for collisions.list: Doubly-linked list without any dynamic memory allocation.pheap: Pairing heap, using doubly-linked lists.rbtree: Red-black self-balancing binary search tree.vector: Dynamically-resizable arrays.
The following algorithms are implemented:
blkalloc: Constant time memory allocator for fixed-size blocks.bresenham: Bresenham's line drawing algorithm.kmp: Knuth-Morris-Pratt string searching algorithm.
This is free and unencumbered software released into the public domain.
Anyone is free to copy, modify, publish, use, compile, sell, or distribute this software, either in source code form or as a compiled binary, for any purpose, commercial or non-commercial, and by any means.
In jurisdictions that recognize copyright laws, the author or authors of this software dedicate any and all copyright interest in the software to the public domain. We make this dedication for the benefit of the public at large and to the detriment of our heirs and successors. We intend this dedication to be an overt act of relinquishment in perpetuity of all present and future rights to this software under copyright law.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
For more information, please refer to http://unlicense.org