归并排序（转载）

最新推荐文章于 2023-09-03 20:36:33 发布

转载最新推荐文章于 2023-09-03 20:36:33 发布 · 158 阅读

本内容遵循CC 4.0 BY-SA版权协议

原文链接：https://blog.csdn.net/k_koris/article/details/80508543?ops_request_misc=%257B%2522request%255Fid%2522%253A%2522162666037516780274188523%2522%252C%2522scm%2522%253A%252220140713.130102334..%2522%257D&request_id=162666037516780274188523&biz_id=0&utm_medium=

收录于

2021暑假专栏收录该内容

44 篇文章

订阅专栏

归并排序详解

#include<iostream>
#include<cstdio>
using namespace std;
void merge(int a[], int l, int r, int mid) {
	int aux[r - l + 1], i, j, k;
	for (k = l;k <= r;k++) aux[k - l] = a[k];
	i = l;j = mid + 1;
	for (k = l;k <= r;k++) {
		if (i > mid) {
			a[k] = aux[j - l];j++;
		}
		else if (j > r) {
			a[k] = aux[i - l];i++;
		}
		else if (aux[i - l] > aux[j - l]) {
			a[k] = aux[j - l];j++;
		}
		else {
			a[k] = aux[i - l];i++;
		}
	}
}
void merge_sort(int a[], int l, int r) {
	if (l >= r) return;
	int mid = (l + r) / 2;
	merge_sort(a, l, mid);
	merge_sort(a, mid + 1, r);
	merge(a, l, r, mid);
}
void mergesort(int a[], int l, int r) {
	merge_sort(a, l, r - 1);
}
int main() {
	int n, a[100];
	cin >> n;
	for (int i = 0;i < n;i++) cin >> a[i];
	mergesort(a, 0, n);
	int s = 0;
	for (int i = 0;i < n;i++) {
		cout << a[i] << ' ';
		s++;
		if (s % 5 == 0) cout << endl;
	}
	return 0;
}