#define SORT_H_INCLUDED
#define MAXSIZE 1000
typedef struct
{
int R[MAXSIZE];
int length;
} sqlist;
typedef sqlist *Sqlist;
void mergesort(Sqlist L);
void msort(int s[],int t[],int i,int j); /**< 递归实现归并函数 */
void Merge(int s[],int t[],int i,int j,int k); /**< 合并函数 */
#endif // SORT_H_INCLUDED
#include <stdio.h>
#include <malloc.h>
#include "sort.h"
void Merge(int SR[],int TR[],int i,int m,int n)
{
int j,k,l;
for(j=m+1,k=i;i<=m && j<=n; k++)/**< 判断语句如为 k<=m && j<=n; 将会出错,中间两个数值将无法归并 */
{
if(SR[i] <=SR[j])
TR[k]=SR[i++];
else
TR[k]=SR[j++];
}
if(i <=m)
{
for( ;i<=m;)
TR[k++]=SR[i++];
}
if(j<=n)
{
for( ;j<=n;)
TR[k++]=SR[j++];
}
}
void msort(int SR[],int TR1[],int s,int t)
{
int m;
int TR2[MAXSIZE];
if(s==t)
TR1[s]=SR[s];
else
{
m=(s+t)/2;
msort(SR,TR2,s,m);
msort(SR,TR2,m+1,t);
Merge(TR2,TR1,s,m,t);
}
}
void mergesort(Sqlist L)
{
msort(L->R,L->R,0,L->length-1);
}
#include <stdio.h>
#include <stdlib.h>
#include "sort.c"
int main()
{
int i;
int d[10]={50,30,21,44,76,52,78,42,88,90};
Sqlist L=(Sqlist )malloc(sizeof(sqlist));
L->length=10;
for(i=0;i <10;i++)
{
L->R[i]=d[i];
}
mergesort( L);
for(i=0;i <10;i++)
printf("%d\t",L->R[i]);
getchar() ;
return 0;
}