快速排序算法代码

快速排序算法代码

#include<iostream>
using namespace std;
typedef int ElementType;

void Swap(int* a, int* b) {
	int temp = *a;
	*a = *b;
	*b = temp;
}

void Insertion_sort(int A[], int N) {
	for (int p = 1; p < N; p++) {
		int tmp = A[p];   // 取出一个数 
		int j = p;
		for (; tmp < A[j - 1] && j > 0; j--)  // 找到这个数适合的位置 
			A[j] = A[j - 1];  // “腾“出位置 
		A[j] = tmp;  //  把合适大小的数放入 
	}
}

/* 快速排序 */

ElementType Median3(ElementType A[], int Left, int Right)
{
	int Center = (Left + Right) / 2;
	if (A[Left] > A[Center])
		Swap(&A[Left], &A[Center]);
	if (A[Left] > A[Right])
		Swap(&A[Left], &A[Right]);
	if (A[Center] > A[Right])
		Swap(&A[Center], &A[Right]);
	/* 此时A[Left] <= A[Center] <= A[Right] */
	Swap(&A[Center], &A[Right - 1]); /* 将基准Pivot藏到右边*/
	/* 只需要考虑A[Left+1] … A[Right-2] */
	return  A[Right - 1];  /* 返回基准Pivot */
}

void Qsort(ElementType A[], int Left, int Right)
{ /* 核心递归函数 */
	int Pivot, Low, High;

	if (2 < Right - Left) {

		Pivot = Median3(A, Left, Right); /* 选基准 */
		cout << Pivot << endl;
		for (int i = 0; i < 12; i++)
			cout << A[i] << ' ';
		cout << endl;
		Low = Left; High = Right - 1;
		while (1) { /*将序列中比基准小的移到基准左边，大的移到右边*/
			while (A[++Low] < Pivot);
			while (A[--High] > Pivot);
			//cout << "Low=" << Low << " High=" << High << endl;
			if (Low < High) Swap(&A[Low], &A[High]);
			else break;
		}
		cout << "Low=" << Low << " High=" << High << endl;
		Swap(&A[Low], &A[Right - 1]);   /* 将基准换到正确的位置 */
		Qsort(A, Left, Low - 1);    /* 递归解决左边 */
		Qsort(A, Low + 1, Right);   /* 递归解决右边 */
	}
	else
		Insertion_sort(A, Right - Left + 1);


}

void QuickSort(ElementType A[], int N)
{ /* 统一接口 */
	Qsort(A, 0, N - 1);
}

int main()
{
	int num[12] = { 23,45,17,11,13,89,72,26,3,17,11,13 };
	int n = 12;
	QuickSort(num, n);
	cout << "排序后的数组为：" << endl;
	for (int i = 0; i < n; i++)
		cout << num[i] << ' ';
	cout << endl;
	return 0;
}