快速排序-C++

#include<vector>
#include<queue>
#include<string>
#include<iostream>
using namespace std;
class Solution
{
public:
    void sort(int arr[], int l, int r)
    {
        if (l >= r)
            return;
        int j = partation(arr, l, r);
        if(j>l)
            sort(arr, l, j - 1);
        if(j<r)
            sort(arr, j + 1, r);
    }
    //切片
    int partation(int arr[], int l, int r)
    {
        int i = l;
        int j = r + 1;
        int mark = arr[l];
        while (true)
        {
            while (arr[++i] <= mark)
                if (i == r)
                    break;
            while (arr[--j] >= mark)
                if (j == l)
                    break;
            if (i >= j)
                break;
            swap(&arr[i],&arr[j]);
        }
        swap(&arr[l], &arr[j]);
        return j;
    }
    //交换
    void swap(int* i, int* j)
    {
        int tmp = *i;
        *i = *j;
        *j = tmp;
    }
};

int main(int argc, char const *argv[])
{
    Solution so;
    int len = 6;
    int a[] = {1,2,6,2,-1,100};
    so.sort(a,0,len-1);
    for(int i=0;i<len;i++){
        cout<<a[i]<<" ";
    }
    return 0;
}