main函数内是测试数据
哨兵实现
#include<stdio.h>
#define MAX 100000000
void merge(int A[], int p, int q, int r); //将一个数组分治并排序
void merge_sort(int A[], int p,int r);
int main(void) {
int A[] = {3,1,5,2,4,7,8,6,9}; //(0,3) (4,7)
merge_sort(A,0,10);
for(int i=0;i<11;i++) {
printf("%d ",A[i]);
}
}
void merge_sort(int A[], int p,int r) {
if(p<r) {
int q = (p+r)/2;
merge_sort(A,p,q);
merge_sort(A,q+1,r);
merge(A,p,q,r);
}
}
void merge(int A[], int p, int q, int r) {
int n1 = q-p+1; //因为包括p,所以+1
int n2 = r-q; //因为不包括q
int L[n1+1];
int R[n2+1];
for(int i=0;i<n1;i++) {
L[i] = A[p+i];
}
for(int i=0;i<n2;i++) {
R[i] = A[r-q+i];
}
L[n1] = MAX;
R[n1] = MAX;
int i = 0;
int j = 0;
for(int k=p;k<=r;k++) {
if(L[i]<R[j]) {
A[k] = L[i];
i++;
}
else {
A[k] = R[j];
j++;
}
}
}
非哨兵实现
#include<stdio.h>
void merge(int A[],int p,int q,int r);
void merge_sort(int A[],int p,int r);
int main(void) {
int A[10] = {1,3,5,7,2,4,15,52,6,8};
merge_sort(A,0,9);
for(int i=0;i<10;i++) {
printf("%d ",A[i]);
}
}
void merge_sort(int A[],int p,int r) {
if(p<r) {
int q = (p+r)/2;
merge_sort(A,p,q);
merge_sort(A,q+1,r);
merge(A,p,q,r);
}
}
void merge(int A[],int p,int q,int r){
int n1 = q-p+1; //理解:一会n1是以退位得出的,所以+1
int n2 = r-q;
int L[n1];
int R[n2];
for(int i=0;i<n1;i++) {
L[i] = A[p+i];
}
for(int i=0;i<n2;i++) {
R[i] = A[q+1+i];
}
int a = p;
int i = 0;
int j = 0;
while(L[i]!= NULL && R[j] !=NULL && a<=r) { //当脚标不越界时
if(L[i]<R[j]) {
A[a] = L[i];
i++;
} else {
A[a] = R[j];
j++;
}
a++;
}
}