使用C语言实现数据结构中的快速排序算法,快速排序算法的思想分治法,是将一组待排数据分成独立的两部分,其中一部分大题小与另一个部分,然后再分别对这两部分进行同样的处理方法,直到排序结束。
static void getPivot(int a[], int low, int high)
{
int pivot = 0;
pivot = low + (high - low) / 2;
if (a[low] > a[high])
{
swap(a, low, high);
}
if (a[high] < a[pivot])
{
swap(a, high, pivot);
}
if (a[low] < a[pivot])
{
swap(a, low, pivot);
}
return;
}
static int partiton(int a[], int low, int high)
{
int pivotKey = 0;
getPivot(a, low, high);
pivotKey = a[low];
while(low < high)
{
while ((low < high)&&(a[high] >= pivotKey))
{
high--;
}
a[low] = a[high];
while ((low < high)&&(a[low] <= pivotKey))
{
low++;
}
a[high] = a[low];
}
a[low] = pivotKey;
return low;
}
static void sortQuick(int a[], int low, int high)
{
int middle = 0;
if (low < high)
{
middle = partiton(a, low, high);
sortQuick(a, low, middle-1);
sortQuick(a, middle+1, high);
}
return;
}
void SortQuick(int a[], int size)
{
if ((NULL == a)||(1 >= size))
{
return;
}
cout << "*** SortQuick ***" << endl;
sortQuick(a, 0, size-1);
return;
}