quicksort.h

来自「本代码实现了几乎所有的排序算法」· C头文件 代码 · 共 35 行

#include <iostream.h>

int Partition(int *Array, int low, int high)
{
   int pivot = Array[low];
   while(low < high)
   {  
	while(low < high && Array[high] >= pivot)
		high --;
	Array[low] = Array[high];
	while(low < high && Array[low] <= pivot)	
		low++;
	Array[high] = Array[low];
   }
    Array[low] = pivot;
    return low;
}


void QuickSort(int *Array,int num  ,int low, int high )
{
	int PivotLocation;
  	if(low < high)
	{
		PivotLocation = Partition(Array, low, high);

		QuickSort(Array, num, low, PivotLocation-1);
		QuickSort(Array, num, PivotLocation+1, high);
  	}
}

void QuickSort(int *Array,int size)
{
	QuickSort(Array,size,0,size-1);
}