归并排序-分冶

归并排序运用了分冶和递归的思想，时间复杂度为O(nlogn).

思想就是将一个需要排序的数列无限进行对半分，最后分为两两一组，这时我们只要需要比较两个数的大小即可，比较之后合并在一起，再对已经合并在一起的两个数列依次进行比较........

#define _CRT_SECURE_NO_WARNINGS	
#include<iostream>
using namespace std;
#include<algorithm>
#include<cmath>
#include<cstring>
#include<string>
#include<map>
#include<vector>
#include<stack>
#include<queue>
#include<deque>
#include<set>
using ll = long long;
using ld = long double;
using PII = pair<int, int>;
ll lowbit(ll x) { return x & -x; }
ll powmod(ll a, ll b, ll MOD) { ll ans = 1; while (b) { if (b % 2)ans = ans * a % MOD; a = a * a % MOD; b /= 2; }return ans; }
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int n;
int a[10000];
int temp[10000];
void merge_pai(int l, int r, int mid) {
	int i = l, p = l, j = mid;
	while (i < mid && j <= r) {
		if (a[i] < a[j])	 	temp[p++] = a[i++];
		else	 	temp[p++] = a[j++];
	}
	while (i < mid)		temp[p++] = a[i++];//防止a[]中前面的数还没有移完
	while (j <= r)		temp[p++] = a[j++];//防止a[]中后面的数还没有移完
	p = i = l;
	while (p <= r)		a[i++] = temp[p++];//转移到a[]中
}
void merge_sort(int l, int r) {
	if (l < r) {
		int mid = (l + r) / 2;
		merge_sort(l, mid);
		merge_sort(mid + 1, r);
		merge_pai(l, r, mid + 1);
	}
}
int main() {
	cin >> n;
	for (int i = 1; i <= n; i++)		cin >> a[i];
	merge_sort(1, n);
	for (int i = 1; i <= n; i++)		cout << a[i] << " ";
	cout << endl;
}