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?
- Email mawangot2000@gmail.com The best way to reach me.
- LinkedIn tatenda-mawango For work and roles.(opens in a new tab)
- GitHub tatendamawango The code behind these projects.(opens in a new tab)
There's also a contact form.