归并排序，快速排序

1.归并排序

#include<iostream>
using namespace std;
//归并排序---分治算法
void Merge(int a[], int s, int m, int  e, int tmp[]) 
{
	int p = 0, pa = s, pb = m + 1;
	while (pa <= m && pb <= e)
	{
		if (a[pa] < a[pb])
			tmp[p++] = a[pa++];
		else
			tmp[p++] = a[pb++];
	}
	while (pa <= m)
		tmp[p++] = a[pa++];
	while(pb<=e)
		tmp[p++] = a[pb++];
	for (int i = 0; i < e - s + 1; i++)
		a[s + i] = tmp[i];
}
void MergeSort(int a[], int s, int e, int tmp[])
{
	if (s < e)
	{
		int m = s + (e - s) / 2;
		MergeSort(a, s, m, tmp);
		MergeSort(a, m + 1, e, tmp);
		Merge(a, s, m, e, tmp);
	}
}
int main(){
	int a[10] = { 23,24,2,65,46,4,3,6756,787 ,946};
	int size = sizeof(a) / sizeof(a[0]);
	int tmp[10];
	for (int i = 0; i < size; i++)
		cout << a[i] << " ";
	cout << endl;
	MergeSort(a, 0, size-1, tmp);
	for (int i = 0; i < size; i++)
		cout << a[i] << " ";
	cout << endl;
	return 0;
}

2.分治的典型应用–快速排序
1.设k=a[0],将k挪到适当位置，使得比k小的元素都在k左边，比k大的元素在k的右边，和k相等的，不关心在k左右出现均可
O(n)时间内完成
2.把k左边的部分快速排序
3.把k右边的部分快速排序

#include<iostream>
using namespace std;
void swap(int& a, int& b) {
	int t = a;
	a = b;
	b = t;
}
void  QuickSort(int a[], int s, int e) {
	if (s >= e)
		return ;
	int k = a[s];
	int i = s, j = e;
	while (i != j)
	{
		while (i < j && a[j] >= k)
			j--;
		swap(a[i], a[j]);
		while (i < j && a[i] <= k)
			i++;
		swap(a[i], a[j]);
	}
	QuickSort(a, s, i - 1);
	QuickSort(a, i + 1, e);
}
int main() {
	int a[10] = { 32,57,5,4,77,2,3,2,32,3 };
	int size = sizeof(a) / sizeof(a[0]);
	for (int i = 0; i < size; i++)
		cout << a[i] << " ";
	cout << endl;
	QuickSort(a, 0, size - 1);
	for (int i = 0; i < size; i++)
		cout << a[i] << " ";
	cout << endl;
	return 0;
}