C++ (Cpp) limited_quicksort Examples

Example #1

File: 8.c Project: jeapostrophe/jeapostrophe.github.com

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);
    }
}

Example #2

File: E_7.4-5.c Project: heaven212/CLRS-solution

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);
    }
}

Example #3

File: E_7.4-5.c Project: heaven212/CLRS-solution

void modified_quicksort(int A[], int p, int r)
{
    limited_quicksort(A,p,r,K);
    insertion_sort(A,p,r);
}

Example #4

File: 8.c Project: jeapostrophe/jeapostrophe.github.com

void new_quicksort(int A[], int p, int r) {
    limited_quicksort(A, p, r);
    insertion_sort(A, p, r);
}