Problem

Understanding algorithmic complexity at a systems level requires hands-on implementation, not just theory.

Solution

A complete suite of sorting algorithms (bubble, selection, insertion, merge, quick, and more) implemented in C with documented Big O time and space complexity.

Architecture

Each algorithm is implemented as a standalone C module with consistent interfaces, benchmark utilities, and inline complexity documentation.

Key Features

Bubble, selection, insertion, merge, and quick sort implementations
Documented time and space complexity for each algorithm
Benchmark comparisons across input sizes
Pure C with no external dependencies

Challenges

Optimizing in-place sorts while maintaining readability and correctness across edge cases.

Outcomes

Demonstrates systems-level CS fundamentals with rigorous documentation.