题目描述
快排quick sort
C++ 代码
#include <iostream>
using namespace std;
const int N =100010;
int q[N];
void q_sort(int q[], int l, int r)
{
if(l >= r) return;
else
{
int i = l - 1, j = r + 1, x = q[(l+r)/2];
while(i < j)
{
do i++; while(q[i] < x);
do j--; while(q[j] > x);
if(i < j) swap(q[i],q[j]);
}
q_sort(q,l,j);
q_sort(q,j+1,r);
}
}
int main()
{
int num;
scanf("%d",&num);
for(int i = 0; i < num; ++ i) scanf("%d",&q[i]);
q_sort(q,0,num-1);
for(int i = 0; i < num; ++ i) printf("%d ",q[i]);
return 0;
}