/************************************************
*函数名称:mergearray
*参数:a:待归并数组;first:开始下标;mid:中间下标;
* last:结束下标;temp:临时数组
*说明:将有二个有序数列a[first...mid]和a[mid...last]合并
*************************************************/
void mergearray(int a[], int first, int mid, int last, int temp[])
{
int i = first, j = mid + 1,k =0;
while (i <= mid && j <= last)
{
if (a[i] <= a[j])
temp[k++] = a[i++];
else
temp[k++] = a[j++];
}
while (i<= mid)
temp[k++] = a[i++];
while (j <= last)
temp[k++] = a[j++];
for (i=0; i < k; i++)
a[first+i] = temp[i];
}
/************************************************
*函数名称:mergesort
*参数:a:待归并数组;first:开始下标;
* last:结束下标;temp:临时数组
*说明:实现给定数组区间的二路归并排序
*************************************************/
void mergesort(int a[], int first, int last, int temp[])
{
if (first < last)
{
int mid = (first + last) / 2;
mergesort(a, first, mid, temp); //左边有序
mergesort(a, mid + 1, last, temp); //右边有序
mergearray(a, first, mid, last, temp); //再将二个有序数列合并
}
}
二路归并排序
最新推荐文章于 2024-06-06 18:00:21 发布