快速排序c语言代码 可直接运行

2种都可直接运行
代码一
#include <stdio.h>
void Quick_Sort(int *arr, int begin, int end){
if(begin > end)
return;
int tmp = arr[begin];
int i = begin;
int j = end;
while(i != j){
while(arr[j] >= tmp && j > i)
j–;
while(arr[i] <= tmp && j > i)
i++;
if(j > i){
int t = arr[i];
arr[i] = arr[j];
arr[j] = t;
}
}
arr[begin] = arr[i];
arr[i] = tmp;
Quick_Sort(arr, begin, i-1);
Quick_Sort(arr, i+1, end);
}
int main()
{
int i;
int a[] = {5,13,6,24,2,8,19,27,6,12,1,17};
int N = 12;
Quick_Sort(a, 0, 11);
for(i=0; i<N; i++)
printf(“%d “, a[i]);
printf(”\n”);

return 0;

}

代码二
#include <stdio.h>

void swap(int a[], int low, int high) //交换两个数的值
{
int t = a[low];
a[low] = a[high];
a[high] = t;
}

int partition(int a[], int low, int high) //计算基准点，分割为左右两个数组
{
int point = a[low];//基准点等于第一个元素
/* while(1){
while(low<high && a[++low]<point);
while(a[–high]>point);
if(low>=high) break;
*/
while(low<high)
{
while(low<high && a[high]>=point)//控制high指针比较并左移
{
high–;
}
swap(a,low,high);
//}
while(low<high && a[low]<=point)//控制low指针比较并右移
{
low++;
}
swap(a,low,high);
}
return low;//返回基准点位置
}

void quicksort(int a[], int low, int high) //low:起始位置 high:末尾位置
{
if(low<high){
int point = partition(a,low,high);//计算基准点
quicksort(a,low,point-1); //对基准点的左边进行排序
quicksort(a,point+1,high);//对基准点的右边进行排序
}
}

int main()
{
int i;
int a[] = {5,13,6,24,2,8,19,27,6,12,1,17};
int N = 12;

quicksort(a, 0, N-1);

for(i=0; i<N; i++) printf("%d ", a[i]);
printf("\n");

return 0;

}