排序——归并排序（顺序存储）

基本思想：

将序列每相邻两个数字进行归并操作（merge)，形成floor(n/2+n%2)个序列，排序后每个序列包含两个元素

将上述序列再次归并，形成floor(n/4)个序列，每个序列包含四个元素

重复步骤2，直到所有元素排序完毕

案例：

排序——归并排序（顺序存储）

代码：

#include<stdio.h>
void Merge(int r[],int r1[],int s,int m,int t){
	int i = s;
	int j = m+1;
	int k = s;
	printf("s = %d, m = %d, t = %d\n", s, m, t);
	printf("\n");
	while(i <= m && j <= t){
		if(r[i] <= r[j])
			r1[k++] = r[i++];
		else
			r1[k++] = r[j++];
	}
	printf("i = %d, j = %d, m = %d\n", i, j, m);
	printf("r1\n");
	for (int p = 0; p < k; p++) {
		printf("%d\t", r1[p]);
	}
	printf("\n");
	
	if(i <= m) {
		while(i <= m)
			r1[k++] = r[i++];
	}
	else {
		while(j <= t)
			r1[k++] = r[j++];
	}
	for(int n = s; n <= t; n++)
		r[n] = r1[n];
	printf("r\n");
	for (int p = 0; p <= t; p++) {
		printf("%d\t", r[p]);
	}
	printf("\n--------------------------------------------------------\n");
	printf("\n");
}
 
void MergeSort(int r[], int r1[], int s, int t){
	if(s<t){
		int m = (s+t)/2;
		MergeSort(r, r1, s, m);
		MergeSort(r, r1, m+1, t);
		Merge(r, r1, s, m, t);
	}
}
int main(){
	int r[8]={10, 39, 5, 1, 9, 34, 54, 65}, r1[8];
	MergeSort(r, r1,0,7);
	printf("\n最终排序结果：\n");
	for(int q = 0; q<8; q++)
		printf("%d\t", r[q]);
	return 0;
}

运行结果：

s = 0, m = 0, t = 1

i = 1, j = 1, m = 0

r1
10

r
10      39
--------------------------------------------------------

s = 2, m = 2, t = 3

i = 2, j = 4, m = 2

r1
10      39      1

r
10      39      1       5
--------------------------------------------------------

s = 0, m = 1, t = 3

i = 0, j = 4, m = 1

r1
1       5

r
1       5       10      39
--------------------------------------------------------

s = 4, m = 4, t = 5

i = 5, j = 5, m = 4

r1
1       5       10      39      9

r
1       5       10      39      9       34
--------------------------------------------------------

s = 6, m = 6, t = 7

i = 7, j = 7, m = 6

r1
1       5       10      39      9       34      54

r
1       5       10      39      9       34      54      65
--------------------------------------------------------

s = 4, m = 5, t = 7

i = 6, j = 6, m = 5

r1
1       5       10      39      9       34

r
1       5       10      39      9       34      54      65
--------------------------------------------------------

s = 0, m = 3, t = 7

i = 4, j = 6, m = 3

r1
1       5       9       10      34      39

r
1       5       9       10      34      39      54      65
--------------------------------------------------------


最终排序结果：
1       5       9       10      34      39      54      65
--------------------------------