第七章快速排序之“快速排序QUICKSORT”

#include <iostream>
using namespace std;


int partition(int *a, int lo, int hi)
{
	int key = a[lo];
	int i = lo;
	int j = hi + 1;
	while (true) {
		while (a[++i] < key) {
			if (i == hi) {
				break;
			}
		}

		while (a[--j] > key) {
			if (j == lo) {
				break;
			}
		}

		if (i < j) {
			int tmp = a[i];
			a[i] = a[j];
			a[j] = tmp;
		}
		else {
			a[lo] = a[j];
			a[j] = key;
			break;
		}
	}
	return j;
}

void QuickSort(int *a, int lo, int hi)
{
	if (hi <= lo) {
		return;
	}
	int j = partition(a, lo, hi);
	QuickSort(a, lo, j - 1);
	QuickSort(a, j + 1, hi);
}

int _tmain(int argc, _TCHAR* argv[])
{
	int i = 0;
	int j = 0;
	int a[BUFFER_SIZE];
	//随机生成数组 
	srand((unsigned)time(NULL));
	for (j = 0; j<BUFFER_SIZE; j++)
	{
		a[j] = rand() % 100;
	}
	printf("随机生成的数组：\n");
	for (i = 0; i<BUFFER_SIZE; i++)
	{
		printf("%d ", a[i]);
	}
	printf("\n");

	QuickSort(a, 0, BUFFER_SIZE - 1);
	printf("对数组进行快速排序：\n");
	for (i = 0; i<BUFFER_SIZE; i++)
	{
		printf("%d ", a[i]);
	}

	system("pause");
	return 0;
}