快速排序的代码

#include<stdio.h>

void swap(int data[], int x, int y) {
int temp = data[x];
data[x] = data[y];
data[y] = temp;
}

void qsort(int A[],int low,int high)
{
int i=low;
int j=high;
int pivot=(low+high)/2;
int temp=A[pivot];
while(i<j)
{
while(A[i]<temp&&i<high) i++;
while(A[j]>temp&&j>low) j--;
if(i<=j)swap(A,i++,j--);
}
if(low<j)  qsort(A,low,j);
if(i<high) qsort(A,i,high);
}
}

int main()
{
int a[6]={2,5,6,8,1,3};
qsort(a,0,5);
for(int i=0;i<6;i++)
printf("%d ",a[i]);
return 0;
}