void limited_quicksort(int A[], int p, int r) { if (r - p > K) { int q = partition(A, p, r); limited_quicksort(A, p, q); limited_quicksort(A, q + 1, r); } }
void limited_quicksort(int A[], int p, int r, int treshold) { if (r-p>treshold) { int q=partition(A,p,r); limited_quicksort(A,p,q,treshold); limited_quicksort(A,q+1,r,treshold); } }
void modified_quicksort(int A[], int p, int r) { limited_quicksort(A,p,r,K); insertion_sort(A,p,r); }
void new_quicksort(int A[], int p, int r) { limited_quicksort(A, p, r); insertion_sort(A, p, r); }