// the find
jtp-codes/warehouse-logistics-system
A C-based inventory and order management console application implementing linked lists for Product and Order structures. Key features include CRUD operations, dynamic memory allocation, and custom recursive Quicksort by price.
A single-file C console app that manages warehouse products and orders using singly linked lists, with a recursive quicksort implemented directly on the list (no array conversion). It's a classic data-structures coursework exercise, aimed at students practicing pointers, malloc/free, and sorting algorithms rather than anyone needing actual inventory software.
The linked-list quicksort partitions and recurses on list nodes directly instead of copying into an array first, which is a legitimate algorithmic exercise most tutorials skip. The code exercises real manual memory management (malloc/free per node) instead of hiding it behind a container library, which is the point of the assignment.
No build system — the README's `gcc src/warehouse_inventory.c` command doesn't even match the actual repo layout (the file is `warehouse_inventory .c`, with a space, sitting in the root, not under src/). A compiled `tempCodeRunnerFile.exe` is committed with no `.gitignore`, so the repo ships a stale binary. Search is a plain linear scan by ID despite the README's efficiency framing, and the 'memory-safe implementation' claim has no backing — no valgrind/ASan run, no tests at all. Everything lives in one file with no header separation, so there's no code to actually review beyond the single source.