quickSort.cpp

void quickSort(int left, int right)
{
    int i, j, x;
    i = left;
    j = right;
    x = mang[(j + i) / 2];

    do {
        while (mang[i++] < x); i--;
        while (mang[j--] > x); j++;

        if (i <= j) swap(mang[i++], mang[j--]);
    } while (i <= j);

    if (i < right) quickSort(i, right);
    if (j > left) quickSort(left, j);
}