快速排序

#include <iostream>

using namespace std;

void kuaipai(int *a, int left, int right)
{
    int i, j, t, temp;
    i = left;
    j = right;
    temp = a[left];

    if (left > right)
        return;

    while(i != j)
    {
        while (a[j] >= temp && i < j)
        {
            j--;
        }
        while (a[i] <= temp && i < j)
        {
            i++;
        }

        if (i < j)
        {
            t = a[i];
            a[i] = a[j];
            a[j] = t;
        }
    }
    a[left] = a[i];
    a[i] = temp;
    //cout << endl;
    //cout << a[1] << endl;

    kuaipai(a, left, i - 1);
    kuaipai(a, i + 1, right);
    //cout << a[left] << a[right]<<endl;
}

int main()
{
    int n;
    int a[10] ;
    cin >> n;
    for (int i = 1; i < n + 1; i++)
    {
        cin >> a[i];
    }

    kuaipai(a, 1, n);

    for (int i = 1; i <= n; i++)
    {
        cout << a[i] << endl;
    }
    return 0;
}

输入

6
3 5 4 6 2 1

输出为

1
2 
3
4
5
6