快速排序算法

#include


int a[12]={23,34,12,31,23,134,12,432,4,12,3123,12};

//获取a[low]值该放置的位置（从小到大）
int FindPos(int low,int high)
{
int val = a[low];
while(low {
while(val<=a[high] && low high--;
a[low] = a[high];
while(val>=a[low] && low low++;
a[high] = a[low];
}
a[low] = val;
return low;
}


void QuickSort(int low,int high)
{
if(low {
int pos = FindPos(low,high);
QuickSort(low,pos);
QuickSort(pos+1,high);
}
}


int main()
{
QuickSort(0,11);
for(int i=0;i<=11;i++)
{
printf("%d\t",a[i]);
}
return 0;
}

#include

int a[12]={23,34,12,31,23,134,12,432,4,12,3123,12};

//获取a[low]值该放置的位置（从小到大）
int FindPos(int low,int high)
{
int val = a[low];
while(low {
while(val<=a[high] && low high--;
a[low] = a[high];
while(val>=a[low] && low low++;
a[high] = a[low];
}
a[low] = val;
return low;
}

void QuickSort(int low,int high)
{
if(low {
int pos = FindPos(low,high);
QuickSort(low,pos);
QuickSort(pos+1,high);
}
}

int main()
{
QuickSort(0,11);
for(int i=0;i<=11;i++)
{
printf("%d\t",a[i]);
}
return 0;
}