/*=======================基数排序的实现===========================*/
typedef struct
{
int data;
int next;
}node;
int head=0;
int fr[10];
int re[10];
void Distribute(node *a, int w) //第一次w=1
{
int i;
for (i=0; i<10; i++) //初始化
fr[i] =-1;
for(i=head; i!=-1; i=a[i].next) //第一次i=0
{
int x = a[i].data / w % 10; //求第一个关键字,即位数
if (fr[x] == -1)
fr[x] = re[x] = i;
else {
a[re[x]].next = i;
re[x] = i;
}
}
for (i=0; i<10; i++)
{
if (fr[i] != -1)
a[re[i]].next = -1;
}
}
void Collect(node *a)
{
int i, last = -1;
for (i=0; i<10; i++)
{
if (fr[i] != -1)
{
if (last == -1)
{
head = fr[i];
last = re[i];
}
else
{
a[last].next = fr[i];
last = re[i];
}
}
}
a[last].next = -1;
}
//输出分配后的结果
void print(node *a, int w)
{
int i, p, k;
for (i=0; i<10; i++)
{
printf("fr[%d] ", i);
p = fr[i];
k = 0;
while (p != -1)
{
printf("->%4d ", a[p].data);
p = a[p].next;
k++;
}
while (k<3)
printf("-------"),k++;
printf("-> re[%d]\n", i);
}
}
//输出收集后的数
void Output(node *a, int head)
{
while (head != -1)
{
printf("%4d", a[head].data);
head = a[head].next;
}
printf("\n");
}
/*=======================归并排序的实现===========================*/
typedef struct
{
int a[MAXSIZE+1];
int length;
}sqlist;
void print(sqlist &L)
{
for(int i=1;i<=L.length;i++)
{
printf("%d ",L.a[i]);
}
printf("\n");
}
//二路归并,将有序的SR(i...m)和SR(m+1...n)归并为TR(i...n)
void Merge(int SR[],int TR[],int i,int m,int n)
{
int j,k;
for(j=m+1,k=i;i<=m&&j<=n;++k)
{
if(SR[i]<=SR[j])
TR[k]=SR[i++];
else
TR[k]=SR[j++];
}
while(i<=m) TR[k++]=SR[i++];//将剩余的SR(i...m)复制到TR
while(j<=n) TR[k++]=SR[j++];//将剩余的SR(j...n)复制到TR
}
//将SR(s...t)归并为TR1(s...t)
void Msort(int SR[],int TR1[],int s,int t)
{
int m;
int TR2[MAXSIZE];
if(s==t)
TR1[s]=SR[t];
else
{
m=(s+t)/2;
Msort(SR,TR2,s,m); //将SR(s...m)归并入TR2(s...m)
Msort(SR,TR2,m+1,t); //将SR(m+1...t)归并入TR2(m+1...t)
Merge(TR2,TR1,s,m,t); //将TR2(s...m) and TR2(m+1...t)归并入R1(s..t)
}
}
void Mergesort(sqlist &L)
{
Msort(L.a,L.a,1,L.length);
}
排序
最新推荐文章于 2020-05-05 22:00:36 发布