Hi, I’m doing a little project at the moment that’s centred around the optimisation of insertion sort.
I removed the various stalls when possible, made various modifications and unrolled some loops. I got it down to about 14927 Cycles with a CPI of 1.007 when sorting 100 elements. Is this reasonable for Insertion sort?
Could someone share the code for Quick Sort so I can compare the two myself?