快速排?/p>
C
语言实现
作者:
来源?
http://blog.csdn.net/cnshinhwa
发表时间?/p>
2007-04-29
浏览次数?/p>
4804
字号?/p>
?/p>
?/p>
?/p>
#include "stdafx.h"
#define LEN 8
int array[LEN] = {45,23,55,1,32,3,56,10};
void outputList()
{
for(int i=0;i<LEN;++i)
{
printf("%d ",array[i]);
}
printf("\n");
}
int partition(int low, int high)
{
int tmp = array[low];
int pivotkey = array[low];
while (low < high)
{
while (low < high && array[high] >= pivotkey) --high;
array[low] = array[high];
while (low < high && array[low] <= pivotkey) ++low;
array[high] = array[low];
}
array[low] = tmp;