快速排序(Quick Sort)

int b[] = { 5,4,7,2,9,5,1,77,33,12 };

 快速排序需要满足三个条件：

1.找中枢值  比中枢值小的放左边，比中枢值大的放右边

2.对左边的数据进行快速排序

3.对右边的数据进行快速排序

代码如下:

#include<iostream>
using namespace std;
int get_mid(int b[], int left, int right) {
	int pivot = b[left];
	while (left<right)
	{
		while (b[right] >= pivot && left < right)
			right--;
		b[left] = b[right];
		while (b[left] <= pivot && left < right)
			left++;
		b[right] = b[left];
    }
	b[left] = pivot;
	return left;
}
void quick_sort(int b[], int left, int right) {
	if (left < right) {
		int mid = get_mid(b, left, right);
		quick_sort(b, left, mid - 1);
		quick_sort(b, mid + 1, right);
	}
}
int main() {
	int b[] = { 5,4,7,2,9,5,1,77,33,12 };
	quick_sort(b, 0, 9);
	for (int i = 0; i < 10; i++)
	{
		cout << b[i] << " ";

	}
}