快速排序

#include<iostream>
#include<algorithm>
using namespace std;
int partition(int A[], int left, int right) {
	int m = left + (right - left) / 2;
	if (A[left] > A[right])
		swap(A[left], A[right]);
	if (A[m] > A[right])
		swap(A[m], A[right]);
	if (A[m] > A[left])
		swap(A[m], A[left]);
	int temp = A[left];
	while (left<right)
	{
		while (left<right&&A[right] > temp)	--right;
		A[left] = A[right];
		while (left < right&&A[left] <= temp)++left;
		A[right] = A[left];
	}
	A[left] = temp;
	return left;
}
void quicksort(int A[], int left, int right) {
	if (left < right) {
		int mid = partition(A, left, right);
		quicksort(A, left, mid - 1);
		quicksort(A, mid + 1, right);
	}
}
int main() {
	int num[100] = { 23,34,5,7,5,24,7,13,7,68,954,4,51,9 };
		quicksort(num,0, 15);
		return 0;
}