C++快速排序

#include<iostream>
#include<stdlib.h>
using namespace std;

#define maxSize 100

void QuickSort(int R[],int low,int high)
{
    int temp;
    int i=low,j=high;
    if(low<high)
    {
        temp=R[low];

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

            while(i<j&&R[i]<temp)
                i++;
            if(i<j)
            {
                R[j]=R[i];
                j--;
            }
        }
        R[i]=temp;

        QuickSort(R,low,i-1);
        QuickSort(R,i+1,high);

    }

}

int main()
{
    int R[maxSize];
    int n=10;
    for(int i=0; i<n; i++)
        R[i]=rand()%101;
    cout<<"before sorting:"<<endl;
    for(int i=0; i<n; i++)
        cout<<R[i]<<"\t";
    cout<<endl;

    QuickSort(R,0,n-1);
    cout<<"after sorting:"<<endl;
    for(int i=0; i<n; i++)
        cout<<R[i]<<"\t";

}

运行结果：