快速排序

#include <iostream>
#include <cstdlib>
#include <ctime>
using namespace std;

void sort(int array[], int left, int right) {
	int i = left, j = right;
	int temp, pivot;
	pivot = array[(left + right) / 2];
	while (i <= j) {
		while (array[i] < pivot) {
			i++;
		}
		while (array[j] > pivot) {
			j--;
		}
		if (i <= j) {
			temp = array[i];
			array[i] = array[j];
			array[j] = temp;
			i++;
			j--;
		}
	}
	if (left < j) {
		sort(array, left, j);
	}
	if (i < right) {
		sort(array, i, right);
	}
}

int main()
{
	srand((unsigned)time(NULL));
	int a[10];
	cout << "排序前：" << endl;
	for (int i = 0; i < 10; i++)
	{
		a[i] = rand() % 1000;
		cout << a[i] << endl;
	}
	sort(a, 0, 9);
	cout << "排序后：" << endl;
	for (int i = 0; i < 10; i++)
	{
		cout << a[i] << endl;
	}
	return 0;
}