归并排序算法

归并排序算法C语言

#include<stdio.h>
#include<stdlib.h>

#define LENGTH 10//定义数组大小

void Merge(int s[],int left,int m,int right)
{
	int low=left,hightlow=m+1,k=0;
	int *s1=(int*)malloc((right-left+1)*sizeof(int));
	//int s1[20];
	while(low<=m&&hightlow<=right)
	{
		if(s[low]<=s[hightlow])//依次取左、右部分的最小值存入s1中
			s1[k++]=s[low++];
		else
			s1[k++]=s[hightlow++];
	}
	while(low<=m)//当左半部分未处理完，依次存入s1中
		s1[k++]=s[low++];
	while(hightlow<=right)//当右半部分未处理完，依次存入s1中
		s1[k++]=s[hightlow++];
	for(int i=0;i<=right-left;i++)
		s[i+left]=s1[i];
	free(s1);//释放临时空间s1
}
void MergeSort(int s[],int left,int right)
{
	if(left<right)//划分的数组元素大于一个
	{
		int m=(left+right)/2;
		MergeSort(s,left,m);
		MergeSort(s,m+1,right);
		Merge(s,left,m,right);
	}
}
int main()
{
	int a[LENGTH];
	for(int i=0;i<LENGTH;i++)
		a[i]=rand()%100+1;
	MergeSort(a,0,LENGTH-1);
	for(int i=0;i<LENGTH;i++)
		printf("%d\n",a[i]);
	return 0;
}