A C++ tool that runs every classic sorting algorithm against the same inputs — single-threaded, and multi-threaded with OpenMP. The results never match the textbook. That's the whole point.
Textbook complexity hides a lot — cache misses, branch prediction, memory allocator warmup, the fact that your laptop throttles when it gets warm. Sort-Alyzer just runs the sorts and measures what actually happens.
I wrote clean implementations of quick, merge, heap, radix, bubble, insertion and shell sort, then wrapped them in an OpenMP harness that can parallelize the divide-step where it makes sense. The output is a little less like a CS exam and more like truth.