三、实例
#include <stdio.h>
///快速排序
//查找位置
int find_pos(int *a, int low, int high)
{
int val = a[low];
while(low < high)
{
while(low < high && a[high] >= val)
{//大于移动,小于则赋值,降序则相反
high--;
}
a[low] = a[high];
while(low < high && a[low] <= val)
{//小于移动,大于则赋值,降序则相反
low++;
}
a[high] = a[low];
}//终止while循环之后low和high一定是相等的
//high可以改为low
a[low] = val;
return low;
}
//low:第一个元素下标
//high:最后一个元素下标
void quick_sort(int *a, int low, int high)
{
if(low < high)
{
int pos = find_pos(a, low, high);
quick_sort(a, low, pos-1);
quick_sort(a, pos+1, high);
}
}
int main(int argc, char *argv[])
{
int a[] = {2, 8, 1, 9, 7, 5, 4, 0, 6, 3};
int n = sizeof(a)/sizeof(a[0]); //数组元素个数
quick_sort(a, 0, n-1); //快速排序
return 0;
}