我的c\c++之旅（二）——归并排序

最新推荐文章于 2024-07-13 19:20:54 发布

mondog2012

最新推荐文章于 2024-07-13 19:20:54 发布

阅读量252

点赞数

分类专栏： c-c++ 文章标签： c语言合并

本文链接：https://blog.csdn.net/mondog2012/article/details/51353229

版权

c-c++ 专栏收录该内容

12 篇文章 0 订阅

订阅专栏

归并排序

/* without malloc error check */
void Merge(int *sequence, int *tmpsequence, int leftbegin, int center, int rightend)
{
    int i, recordleft, leftend, rightbegin;

    i = recordleft = leftbegin;
	leftend = center;
    rightbegin = center + 1;

    while(leftbegin <= leftend && rightbegin <= rightend) {
        if(sequence[leftbegin] < sequence[rightbegin])
            tmpsequence[i++] = sequence[leftbegin++];
        else
            tmpsequence[i++] = sequence[rightbegin++];
    }
    while(leftbegin <= leftend)
		tmpsequence[i++] = sequence[leftbegin++];
    while(rightbegin <= rightend)
		tmpsequence[i++] = sequence[rightbegin++];
    for(i = recordleft; i <= rightend; i++)
		sequence[i] = tmpsequence[i];
}

void MSort(int *sequence, int *tmpsequence, int left, int right)
{
	int center;

    if(left < right) {
        center = (left + right) / 2;
        MSort(sequence, tmpsequence, left, center);
        MSort(sequence, tmpsequence, center+1, right);
        Merge(sequence, tmpsequence, left, center, right);
    }
}

void Merge_Sort(int *sequence, int n)
{
    int *tmpsequence;

	tmpsequence = (int*)malloc(sizeof(int) * n);
	MSort(sequence, tmpsequence, 0, n-1);
	free(tmpsequence);
}