I’m doing a project where I manually create sorting algorithms.

After several tests I found out that my heapsort is way quicker than quicksort (I think it should be the other way around), my selection sort is also faster than insertion sort. does anyone know what’s the problem here?

I’m testing using integers from -100 to 100, randomly generated, 5000 values in an array (I modified this number several times, still the same problems).

My quicksort isn’t in-place.

I thought that maybe flash’s recursive functions are slow? my heapsort uses loops, unlike quicksort. That’s just a hypothesis though.