本人使用的是微课版教材,其上代码丢三落四不能成行。两路合并算法更是错误百出。老师的ppt照搬了课本,同样无法运行。在此提交我花了一些时间修正的代码,供遇到同样问题的同学参考,节省一些因为他人谬误而浪费的时间。其中所用的结构体也一并提供。
typedef int KeyType;
typedef int DataType;
typedef struct entry {
KeyType key;
DataType date;
}Entry;//entry就是待排序的每个元素
typedef struct list {
int n;//待排序元素数量
Entry D[MaxSize];//Maxsize自定
}List;
void Merge(List* list, Entry* temp, int low, int n1, int n2)
{
int i = low;
int j = low + n1;
int k = low;
while (i <= low + n1 - 1 && j <= low + n1 + n2 - 1)
{
if (list->D[i].key <= list->D[j].key)
temp[k++] = list->D[i++];
else
temp[k++] = list->D[j++];
}
while (i <= low + n1 - 1)temp[k++] = list->D[i++];
while (j <= low + n1 + n2 - 1)temp[k++] = list->D[j++];
}
void MergeSort(List* list)
{
Entry temp[MaxSize-1] = { 0 };
int low, n1, n2, i, size = 1;
int count = 0;
while (size < list->n) {
low = 0;
while (low+size < list->n) {
n1 = size;
if (low + size * 2 < list->n)
n2 = size;
else
n2 = list->n - low - size;
Merge(list, temp, low, n1, n2);
low += n1 + n2;
}
if(size==1&&list->n%2)
temp[list->n-1]=list->D[list->n-1];
for (i = 0; i < list->n; i++)
list->D[i] = temp[i];
size *= 2;
}
}