if ((j - first) > SMALLEST_QSORT_PARTITION) my_qsort( data, first, j-1 ); else insertion_sort( data, first, j-1 ); if ((last - j) > SMALLEST_QSORT_PARTITION ) my_qsort( data, j+1, last ); else insertion_sort( data, j+1, last );