quickSort(tab[], start, end)

if(start < end)
{
    pivot = tab[start]
    l = start + 1;
    r = end;

        while(true)
            {
            while(tab[l] < pivot && l <= end) l++;
            while(tab[r] >= pivot && r > start) r--;
            if(l < r){swap(tab[l], tab[r]) l++, r--;}
            else break;
        }
        swap(tab[start], tab[r])
        quickSort(tab[], start, r - 1);
        quickSort(tab[], l, end);
    }
}