郝斌《数据结构》课程源代码
用者自取,自由分享
#include <stdio.h>
void QuickSort(int * , int , int );
int FindPos(int * , int , int );
int main(void)
{
int a[6] = {2, 1, 0, 5, 4, 3};
int i;
QuickSort(a, 0, 5);
for(i = 0; i < 6; ++i)
{
printf("%d ", a[i]);
}
printf("\n");
return 0;
}
void QuickSort(int * a, int low, int high)
{
int pos;
if(low < high)
{
pos = FindPos(a, low, high);
Quick(a, low, pos-1);
Quick(a, pos+1, high);
}
return ;
}
int FindPos(int * a, int low, int high)
{
int val = a[low];
while(low < high)
{
while(low < high && a[high] >= val)
{
--high;
}
a[low] = a[high];
while(low < high && a[low] <= val)
{
++low;
}
a[high] = a[low];
}
a[low] = val;
return low;
}