Graph theory and sorting algorithms coursework

Implemented and analyzed core graph and sorting algorithms from first principles rather than calling a library: Prim's and Kruskal's for minimum spanning trees, Dijkstra's for shortest path, and Heap Sort, each written by hand and then measured, not just proven correct on paper.

The real work was the comparison across graph density: how each algorithm's actual runtime behavior shifted as the input graph went from sparse to dense, and where the textbook complexity class stopped predicting real performance cleanly.

It's the kind of coursework that looks small next to a full application build but teaches something a bigger project can't: what an algorithm actually costs once you've measured it yourself instead of trusting a Big-O notation to tell the whole story.