C11 Core System
A highly optimized algorithmic engine designed in pure C11. This project simulates an enterprise-level recipe and supply management system subject to strict constraints on execution time and heap memory usage. Data structures such as custom hash tables with separate chaining, dynamic arrays, and a Min-Heap were implemented purely from scratch.
O(1) Separate Chaining
Designed and implemented a custom Hash Map resolving collisions via chaining. This custom implementation handles intensive string-based product memory allocations and lookups in average constant time.
O(log n) Array Min-Heaps
Standard external libraries were completely prohibited. I built an array-based Min-Heap entirely from the ground up to globally query expiring supply batches instantly and maintain strict memory density bounds without fragmented node allocation.
Zero-Leak Valgrind Stress Tests
Managed thousands of active heap memory allocations manually `(malloc, calloc, realloc)`. Survived intense Valgrind stress testing by executing deeply nested manual garbage collection, achieving absolutely zero memory leaks.
Key Contributions & Achievements
Designed and implemented a custom Hash Map with chaining to handle string-based recipe lookups in O(1) average time.
Engineered an array-based Min-Heap structure to manage expiring supply batches dynamically and extract items in O(log n) time.
Successfully delivered stable C11 code that passes extensive randomized algorithmic stress-testing suites perfectly, adhering to strict bounds for both time and space complexity.
Managed all heap memory allocations manually, ensuring absolutely zero memory leaks via precise garbage collection strategies across deeply nested pointer structures.