快速排序

#include<stdio.h>


int b[100];


void Quicksort(int *data, int length)
{
QSort(data,0,lengyh);
}


int Partition(int *data, int low ,int hign)
{
int key = low;
int i=key+1,j=hign;
int a[100];
while(i<=hign)
{
if( data[key] <= data[i] )
{
a[i] = data[i];
i++;
}
else
{
a[j] = data[i];
j--;
}
}
a[i+1] = data[key];
key = i+1;
for(i=low;i<=hign;i++)
{
b[i] = a[i];
}
return key;
}


void QSort(int *data,int low ,int hign)
{
if(low == hign)
else
{
key = Partition(data, low ,hign)
QSort(data, low,key-1);
QSort(data, key+1,hign);
} 
}
















int main()
{

}