数据结构：归并排序

最新推荐文章于 2024-10-02 23:04:10 发布

听说有人ID没取完就

最新推荐文章于 2024-10-02 23:04:10 发布

阅读量49

点赞数 1

分类专栏：数据结构文章标签：学习 c语言数据结构排序算法

本文链接：https://blog.csdn.net/m0_73497041/article/details/130044417

版权

数据结构专栏收录该内容

19 篇文章 0 订阅

订阅专栏

void _MergeSort(int* a, int left, int right, int* tmp)
{

	if (left >= right)
	{
		return;
	}

	int mid = (right + left) / 2;
	_MergeSort(a, left, mid, tmp);
	_MergeSort(a, mid + 1, right, tmp);
	int begin1 = left;
	int end1 = mid;
	int begin2 = mid + 1;
	int end2 = right;
	int i = left;

	while (begin1 <= end1 && begin2 <= end2)
	{

		if (a[begin1] > a[begin2])
		{
			tmp[i++] = a[begin2++];
		}
		else
		{
			tmp[i++] = a[begin1++];
		}

	}

	while (begin1 <= end1)
	{
		tmp[i++] = a[begin1++];
	}

	while (begin2 <= end2)
	{
		tmp[i++] = a[begin2++];
	}

	memcpy(a + left, tmp + left, sizeof(int) * (right - left + 1));
}

void MergeSort(int* a, int n)
{
	int* tmp = (int*)malloc(sizeof(int) * n);

	if (tmp == NULL)
	{
		perror("malloc fail");
		return;
	}

	_MergeSort(a, 0, n - 1, tmp);
	free(tmp);
}