My own implementation of some common sorting algorithms
What I learned - a hybrid quicksort with insertion sort can improve speeds over plain quicksort
The benefit is even better with a higher threshold (48-64) when there are many duplicate values but lower (10) with mostly unique values