Sorting Algorithms Benchmark
Heapsort, quicksort and insertion sort in C# with execution-time tracking and Excel-based reporting.
The classic “which sort wins at which size” question, answered empirically. Three implementations, a timing harness, and Excel output for plotting, showing where insertion sort’s O(n²) becomes painful and where quicksort’s average-case dominates.
Correspondence
Research, data science work or a question about a project. Email, LinkedIn or the contact form all reach me.
There is also a contact form, and aresume (PDF).