快速排序QuickSort.c

#include<stdio.h>

int sorted(int a[],int low,int high){

int temp=0;

int sign=a[low];

while(low<high){

while(low<high && sign<a[high])

--high;

temp=a[high];

a[high]=a[low];

a[low]=temp;

while(low<high && a[low]<sign)

++low;

temp=a[low];

a[low]=a[high];

a[high]=temp;

}

return low;

}

void sort(int a[],int low,int high){

int sign=0;

if(low<high){

sign=sorted(a,low,high);

sort(a,low,sign-1);

sort(a,sign+1,high);

}

}

void main()

{

int a[20];

int i=0;

int count=0;

printf("count= ");

scanf("%d",&count);

for(i=0;i<count;i++){

printf("a[%d]=",i);

scanf("%d",&a[i]);

}

sort(a,0,count-1);

printf("/nThe sorted numbers:/n");

for(i=0;i<count;i++)

printf("%d ",a[i]);

printf("/nSort Work Is OK!/n/n");

getchar();

}