Native sort function has too high complexity
Created by: stephanemagnenat
The native function math.sort
is using a Comb sort algorithm which has a O(n^2) average and worst-case performance. This should be improved with a better sort algorithm, heap sort being a good candidate.