数据结构：归并排序（非递归）

void MergeSortNonR(int* a, int n)
{
	int* tmp = (int*)malloc(sizeof(int) * n);
	int gap = 1;
	
	if (tmp == NULL)
	{
		perror("malloc fail");
		return;
	}

	while (gap < n)
	{

		for (int i = 0; i < n; i += 2 * gap)
		{
			int begin1 = i;
			int end1 = i + gap - 1;
			int begin2 = i + gap ;
			int end2 = i + 2 * gap - 1;
			int j = i;

			if (end1 > n - 1 || begin2 > n - 1)
			{
				break;
			}

			if (end2 > n - 1)
			{
				end2 = n - 1;
			}

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

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

			}

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

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

			memcpy(a + i, tmp + i, sizeof(int) * (end2 - i + 1));
		}

		gap *= 2;
	}

	free(tmp);
	tmp = NULL;
}