快速排序

#include<iostream>

using namespace std;

int Div(int a[], int left, int right)
{
    int base = a[left];
    while(left < right)
    {
        while(left < right && a[right] > base)
        {
            right--;
        }
        a[left] = a[right];
        while(left < right && a[left] < base)
        {
            left++;
        }
        a[right] = a[left];
    }
    a[left] = base;
    return left;
}

int quicksort(int a[], int left, int right)
{
    int i;
    if(left < right)
    {
        i = Div(a, left, right);
        quicksort(a, left, i - 1);
        quicksort(a, i + 1, right);
    }
}


int main()
{
    int a[5];
    for(int i = 0; i < 5; i++)
        cin >> a[i];
    quicksort(a, 0, 4);
    for(int i = 0; i < 5; i++)
    {
        cout << a[i] << " ";
    }
    cout << endl;
}