All projects

Sorting Algorithms Benchmark

Heapsort, quicksort and insertion sort in C# with execution-time tracking and Excel-based reporting.

Which sort wins at which size? I implemented heapsort, quicksort and insertion sort in C#, timed them, and wrote the results out to Excel for plotting. The plots show where insertion sort’s O(n²) starts to hurt and where quicksort’s average case takes over.

Get in touch

Have a research idea, a role, or a question about one of these projects?

There's also a contact form.