c++数组快速排序
#include <iostream>
using namespace std;
void quickSort(int num[],int left,int right)
{
int l = left, r = right;
int temp = num[l];
while(l < r)
{
while(num[r] > temp && l < r)
{
r--;
}
if(l < r)
{
num[l] = num[r];
}
while(num[l] < temp && l < r)
{
l++;
}
if(l < r)
{
num[r] = num[l];
}
}
num[r] = temp;
if(l + 1 < right)
quickSort(num,l+1,right);
if(r - 1 > left)
quickSort(num,left,r - 1);
}
int main()
{
int num[] = {1,5,6,9,20,81,32,54,10,201,100};
quickSort(num,0,sizeof(num)/sizeof(int) - 1);
for(int i = 0; i < sizeof(num)/sizeof(int); i++)
cout << num[i] << " ";
}