不多说直接上代码,先来一份递归的,非递归后期补上
代码:
#include<iostream>
#include<time.h>
using namespace std;
void bing(int *a, int *b, int s, int e, int mid) {//并(治)
int i = s, j = mid + 1;
int m = mid, n = e;
int k = 0;
while (i<=m&&j<=n) {
if (a[i] <= a[j])
b[k++] = a[i++];
else b[k++] = a[j++];
}
while (i <= m) {
b[k++] = a[i++];
}
while (j <= n)
b[k++] = a[j++];
for (int i = 0; i < k; i++)
a[s+i] = b[i];
}
void merge_sort(int *a, int *b, int s, int e) {//分
int mid;
if (s < e) {
mid = (s + e) / 2;
merge_sort(a, b, s, mid);
merge_sort(a, b, mid + 1, e);
bing(a, b, s, e, mid);
}
}
void print(int *a, int e) {
for (int i = 0; i < e; i++) {
cout << a[i] << " ";
}
}
void init() {
int n; cin >> n;
int *a = new int[n + 1];
int *b = new int[n + 1];
srand((unsigned)time(nullptr));
for (int i = 0; i < n; i++)
a[i] = rand() % 1000;
merge_sort(a, b, 0, n - 1);
print(a, n);
}
int main(void) {
init();
return 0;
}
递归采用的就是分治的想法,先分开,分到一个元素,在合并,有序序列的合并是简单的也是快速的,想法就是为了让合并更快而设计的递归分离原数组(这是我的臆测)。另外归并排序的时间复杂度都是O(nlogn)