归并排序:将两个或两个以上有序表合成一个新的有序表。
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
typedef int ElemType;
#define MaxSize 100
/*归并排序:将两个或两个以上有序表合成一个新的有序表*/
ElemType* B = (ElemType*)malloc(sizeof(ElemType) * MaxSize);//辅助数组
void Merge(int A[], int low, int mid, int high) {//(low,mid)与(mid+1,high)两个有序序列进行归并
for (int i = 0; i <= high; i++) {
B[i] = A[i];//将A序列元素复制到B序列中
}
int i = low, j = mid + 1, k = i;//注意i,j,k元素的初始化
while (i <= mid && j <= high) {//每次选两个序列中的最小值插入A数组中
if (B[i] < B[j]) {
A[k++] = B[i++];
}
else {
A[k++] = B[j++];
}
}
while (i <= mid) {//第一个序列有剩余元素
A[k++] = B[i++];
}
while (j <= high) {//第二个序列有剩余元素
A[k++] = B[j++];
}
}
void MergeSort(int A[], int low, int high) {
if (low < high) {//递归进行条件
int mid = (low + high) / 2;
MergeSort(A, low, mid);//对前一半元素进行归并排序
MergeSort(A, mid + 1, high);//对后一半元素进行归并排序
Merge(A, low, mid, high);//将(low,mid)与(mid+1,high)两个序列进行归并
}
}
int main() {
int len, A[MaxSize];
scanf("%d", &len);
for (int i = 0; i <len; i++) {
scanf("%d", &A[i]);
}
MergeSort(A, 0,len-1);
for (int i = 0; i < len; i++) {
printf("%d ", A[i]);
}
return 0;
}