快速排序QuickSort

#include <iostream>
#include <vector>

using namespace std;

void quickSort(int s[], int l, int r)
{
    if(l < r)
    {
        int left = l, right = r;
        int val = s[left];

        while(left < right)
        {
            while(left < right && s[right] >= val)
                right--;
            if(left < right)
                s[left++] = s[right];

            while(left < right && s[left] < val)
                left++;
            if(left < right)
                s[right--] = s[left];
        }

        s[left] = val;
        quickSort(s, l, left - 1);
        quickSort(s, left + 1, r);
    }
}

int main()
{
    const int len = 3;
    int s[len] = {72, 6, 57};
    int l = 0, r = len  -1;

    quickSort(s, l, r);

    for(int i = 0; i <= r; i++)
    {
        printf("%d\t", s[i]);
    }

    return 0;
}