归并排序递归、非递归实现

#include <cstdio>
#define min(a, b) a < b ? a : b
void print(int arr[], int n) {
	for (int i = 0; i < n; i++)
		printf("%d ", arr[i]);
	putchar(10);
}
void swap(int arr[], int x, int y) {
	int t = arr[x];
	arr[x] = arr[y];
	arr[y] = t;
}

int c[101];
void nonrec_merge_sort(int arr[], int n) {
	for (int s = 1; s < n; s *= 2) {
		for (int i = 0; i < n; i += 2 * s) {
			int l = i, r = i + s;
			if (r > n)
				break;
			int le = l + s, re = min(r + s, n), index = 0;
			while (l < le && r < re) {
				if (arr[l] < arr[r])
					c[index++] = arr[l++];
				else
					c[index++] = arr[r++];
			}
			while (l < le)
				c[index++] = arr[l++];
			while (r < re)
				c[index++] = arr[r++];
			for (int k = 0; k < index; k++)
				arr[k + i] = c[k];
		}
	}
}

void rec_merge_sort(int arr[], int n) {
	if (n <= 1)
		return;
	rec_merge_sort(arr, n / 2);
	rec_merge_sort(arr + n / 2, n - n / 2);
	int i = 0, j = n / 2, index = 0;
	while (i < n / 2 && j < n) {
		if (arr[i] < arr[j])
			c[index++] = arr[i++];
		else
			c[index++] = arr[j++];
	}
	while (i < n / 2)
		c[index++] = arr[i++];
	while (j < n)
		c[index++] = arr[j++];
	for (int i = 0; i < index; i++)
		arr[i] = c[i];
}

int main() {
	int arr[] = { 1, 3, 2, 6, 4, 5 };
	int len = 6;
	nonrec_merge_sort(arr, len);
	print(arr, len);
	rec_merge_sort(arr, len);
	print(arr, len);
	return 0;
}