I would like to implement some sorting algorithm that is fast enough to sort 500 numbers many many times (e.g. 300 iterations of sorting 500 numbers each)
I don't like quick sort, merge sort because they are harder to implement than bubble sort, selection sort, insertion sort..
Just wondering what is the best (simple to implement and with some best cases complexity less than O(N2) if many numbers are already sorted) simplest sorting algorithm in this case
The numbers to sort are type of doubles.