Welcome to Tom’s Ultimate C ADT Library! This is your go-to collection of high-performance, reusable data structures written in pure C. Designed for efficiency, ease of use, and flexibility, these ADTs help you streamline your projects without the hassle of reinventing the wheel.
This library features a set of powerful, well-tested Abstract Data Types (ADTs), each with a clean, consistent API. Here's what you get:
- Dynamic Array – Fast, flexible, and memory-efficient.
- Linked List (Coming soon!) – Because sometimes arrays just don’t cut it.
- Stack (Coming soon!) – Push, pop, and conquer.
- Queue (Coming soon!) – First in, first out, no stress.
- Hash Table (Coming soon!) – O(1) lookups for the win!
- AVL Tree (Coming soon!) – Self-balancing, because balance matters.
- ...and more!
Each ADT is implemented as a modular, standalone component with a clear and intuitive interface. Whether you’re building system-level software or just need a rock-solid data structure, this library has you covered.
- 🔥 Performance-Oriented – Optimized for speed and memory efficiency.
- 🛠 Easy to Integrate – Drop it into any C project with minimal setup.
- 📚 Well-Documented API – Clean, consistent function signatures.
- 🏗 Extensible – Designed to be easily modifiable and extendable.
Stay tuned for updates as new ADTs roll out! 🚧
- Dynamic Array Function Reference 📂
- Installation Guide (Coming Soon)
💬 Feedback? Ideas? Hit me up—contributions and suggestions are always welcome!