#include <stdio.h>
#include <stdlib.h>
void MSort(int a[],int temp[],int low,int high);
void MergeSort(int *a,int len) //归并排序算法
{
int *TR = (int *)malloc(sizeof(int) * len); //动态分配一个额外的存储空间
MSort(a,TR,0,len-1); //分裂然后调用归并排序
free(TR); //释放内存
}
void Merge(int a[],int TR[],int low,int mid,int high) //归并排序
{
int i = low;
int j = mid + 1;
int k = 0;
while(i <= mid && j <= high)
{
if(a[i] < a[j]) //进行排序存入动态分配的数组中
TR[k++] = a[i++];
else
TR[k++] = a[j++];
}
while(i <= mid) //如果前一半中还有未处理完的数据,按顺序移入动态分配的数组内
TR[k++] = a[i++];
while(j <= high) //如果后一半中还有未处理完的数据,按顺序移入动态分配的数组内
TR[k++] = a[j++];
for(int v = 0,i = low;i <= high;++v,++i) //将排序好的数据移回到原序列中
a[i] = TR[v];
}
void MSort(int a[],int temp[],int low,int high)//参数中a:数组名,temp:存储数组名,low:分裂低位标号,high:分裂高位标号
{
int mid;
if(low < high)
{
mid = (low + high) / 2; //进行分裂
MSort(a,temp,low,mid); //将前一半继续分裂
MSort(a,temp,mid + 1,high); //将后一半继续分裂
Merge(a,temp,low,mid,high); //进行归并排序
}
}
int main()
{
int a[] = {20,19,35,33,17,42,15,55,9,5,8,3,1};
int len = sizeof(a) / sizeof(*a);
MergeSort(a,len);
printf("排序后的数组序列:\n");
for(int i = 0;i < len;++i)
printf("%d ",a[i]);
printf("\n");
return 0;
}
12-22
07-23
07-23
07-23