// the find
rathodsiddhi178-cell/blinkit-management-system-c
Quick-commerce backend simulation in C featuring B-Tree indexing, dirty-flag caching, order processing, delivery routing, and file persistence.
A C project that simulates a quick-commerce backend (think Blinkit/Zepto) using B-Tree indexing for all major entities. Built as a learning exercise in data structures and systems programming — not production code, but a reasonably complete simulation of the domain.
- Using B-Trees for indexing customer, rider, order, and inventory records is the right call — demonstrates understanding of why databases don't just use arrays
- Dirty-flag caching to avoid redundant merge sort passes is a legitimate pattern lifted straight from OS/filesystem design; good that it appears here
- Flat C with a Makefile and a single header is actually a clean structure for a project this size — no build system complexity getting in the way
- Covers the full domain loop: order placement → nearest store selection → rider assignment → delivery → earnings update — not just CRUD
- Zero stars, no tests, no sample data files — impossible to know if the file persistence actually round-trips correctly without running it yourself
- Pincode-based distance is almost certainly a hardcoded lookup table, not real routing; fine for a demo but the README implies it's a routing system
- Single-file main.c + operations.c split suggests everything is in one giant translation unit with global state — this pattern falls apart fast if you extend it
- No error handling visible in the README or tree; C file I/O without explicit failure paths is a common source of silent data corruption