void quick_sort_helper(double val[], int p, int r)
{
    if (p<r)
    {
        int q = partition (val, p, r);
        quick_sort_helper(val, p, q-1);
        quick_sort_helper(val, q+1, r);
    }
}
Beispiel #2
0
void quick_sort(randomIt begin,randomIt end){
   quick_sort_helper(begin ,end -1);
}
void quick_sort(double val[], int LENGTH)
{
    quick_sort_helper(val, 0, LENGTH-1);
}