#define MAX_SIZE 10
typedef struct
{
int m[MAX_SIZE ];
int length;
} SqList;
//用排序,铁定跑不了这个swap函数,最好自己写一个
void swap(SqList *q, int i, int j);
void swap(SqList *q, int i, int j)
{
int temp = q->m[i];
q->m[i] = q->m[j];
q->m[j] = temp;
{
int *TR = (int *)malloc(L->length * sizeof(int));
int k = 1;
while (k < L->length)
{
MergePass(L->m, TR, k, L->length);
k = k * 2;
MergePass(TR, L->m, k, L->length);
k = k * 2;
}
}
void MergePass(int SR[], int TR[], int s, int n)
{
int i = 1;
int j;
while (i <= n - 2 * s + 1)
{
Merge(SR, TR, i, i + s - 1, i + 2 * s - 1);
i = i + 2 * s;
}
if (i < n - s + 1)
{
Merge(SR, TR, i, i + s - 1, n);
}
else
{
for (j = i; j <= n; j++)
{
TR[j] = SR[j];
}
}
}
typedef struct
{
int m[MAX_SIZE ];
int length;
} SqList;
//用排序,铁定跑不了这个swap函数,最好自己写一个
void swap(SqList *q, int i, int j);
void swap(SqList *q, int i, int j)
{
int temp = q->m[i];
q->m[i] = q->m[j];
q->m[j] = temp;
}
//归并排序算法升级版,不用递归,用迭代思想
//递归方法:代码简单,程序简介明了,但时间损耗和空间损耗贼鸡儿哟严重
//迭代方法效率提高了很多,性能上也提高了,但代码可能有点难
void MergeSort2(SqList *L){
int *TR = (int *)malloc(L->length * sizeof(int));
int k = 1;
while (k < L->length)
{
MergePass(L->m, TR, k, L->length);
k = k * 2;
MergePass(TR, L->m, k, L->length);
k = k * 2;
}
}
void MergePass(int SR[], int TR[], int s, int n)
{
int i = 1;
int j;
while (i <= n - 2 * s + 1)
{
Merge(SR, TR, i, i + s - 1, i + 2 * s - 1);
i = i + 2 * s;
}
if (i < n - s + 1)
{
Merge(SR, TR, i, i + s - 1, n);
}
else
{
for (j = i; j <= n; j++)
{
TR[j] = SR[j];
}
}
}