C++快速排序

#include <iostream>
using namespace std;

void QuickSort(int a[], int left, int right)
{


    int temp;
    int i = left, j = right;
    temp = a[left];
    if(i >= j)//
        return;
    while(i != j)
    {
        while(a[j] >= temp && i < j)
            j--;
        a[i] = a[j];
        while(a[i] <= temp && i < j)
            i++;
        a[j] = a[i];
    }
    a[i] = temp;
    QuickSort(a, left, i - 1);
    QuickSort(a, i + 1, right);

}
int main()
{
    int a[10] = {6, 1, 2, 7, 9, 3, 4, 5, 10, 8};
    QuickSort(a, 0, 9);
    for(int i = 0; i < 10; i++)
    {
        cout << a[i] << endl;
    }
    
    return 0;
}