代码:
void quick_sort(int q[],int l,int r)
{
if(l>=r)
{
return;
}
int x = q[(l+r)/2],i = l-1,j = r+1;
while(i<j)
{
do i++;while(q[i]<x);
do j--;while(q[j]>x);
if(i<j)
{
int k = q[i];
q[i] = q[j];
q[j] = k;
}
}
quick_sort(q,l,j);
quick_sort(q,j+1,r);
}
看这题:
输入:
5
4 2 4 5 1
输出:
1 2 4 4 5
完整代码:
#include <stdio.h>
void quick_sort(int q[],int l,int r)
{
if(l>=r)
{
return;
}
int x = q[(l+r)/2],i = l-1,j = r+1;
while(i<j)
{
do i++;while(q[i]<x);
do j--;while(q[j]>x);
if(i<j)
{
int k = q[i];
q[i] = q[j];
q[j] = k;
}
}
quick_sort(q,l,j);
quick_sort(q,j+1,r);
}
int main()
{
const int N = 1e5;
int arr[N];
int n = 0;
scanf("%d",&n);
for(int i = 0;i<n;i++)
{
scanf("%d",&arr[i]);
}
quick_sort(arr,0,n-1);
int flag = 0;
for(int i = 0;i<n;i++)
{
if(flag)
{
printf(" ");
}
printf("%d",arr[i]);
flag = 1;
}
return 0;
}
结果: