快速排序的简单理解:
代码如下:
#include<stdio.h>
#include<stdlib.h>
void quick_sort(int pa[],int low,int high)
{
int i = low;
int j = high;
int tmp = pa[i];
if(i > j) //这个条件是递归终止条件
return;
while(i < j)
{
while(i < j && tmp < pa[j]) //i < j这个条件一定得加
j--;
if(i < j)
{
pa[i] = pa[j];
i++;
}
while(i < j && tmp > pa[i])
i++;
if(i < j)
{
pa[j] = pa[i];
j - -;
}
}
pa[i] = tmp;
quick_sort(pa,low,i-1);
quick_sort(pa,i+1,high);
}
int main(int argc, const char *argv[])
{
int i;
int a[9] = {2,1,3,4,5,6,7,8,9};
printf("原数组:");
for(i = 0;i < 9;++i)
printf("%2d ",a[i]);
putchar('\n');
quick_sort(a,0,8);
printf("快排后:");
for(i = 0;i < 9;++i)
printf("%2d ",a[i]);
putchar('\n');
return 0;
}