#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;
return low;
}
void qSort(int low,int high)
{
if (low < high)
{
int pivotloc = partition(low, high);
qSort(low, pivotloc - 1);
qSort(pivotloc + 1, high);
}
}
void main()
{
printf("The data before sort : /n");
outputList();
qSort(0,LEN-1);
printf("The data after sort : /n");
outputList();
}
结果:
The data before sort :
45 23 55 1 32 3 56 10
The data after sort :
1 3 10 23 32 45 55 56
Press any key to continue