归并排序算法

// MergeSort.c

#include <stdio.h>
#include <time.h>
#include <stdlib.h>

typedef int DataType;

typedef unsigned char NumType; // 有效个数:2至255

// ( ( 2 ^ ( sizeof ( NumType ) * 8 ) ) - 1 )
#define LIMIT ( NumType ) ( ( 1 << ( sizeof ( NumType ) << 3 ) ) - 1 )

typedef short TYPE; // TYPE 至少比排序个数大一个级别的数据类型单位

void Merge(DataType * const, DataType *, const NumType, const TYPE, const TYPE);
void MergePass(DataType * const, DataType *, const NumType, const TYPE);
void MergeSort(DataType * const, const NumType);

int main(void)
{
	NumType i, sum;
	DataType data[LIMIT] = { 0 };

	srand((unsigned int)time(0));

	puts("生成随机数:\n");
	for (i = 0; i < LIMIT; ++i)
	{
		// 随机生成0至32767共计32768种随机数字
		data[i] = rand();
		printf("%-5d\t", data[i]);
		if (i % 10 == 9)
			putchar('\n');
	}

	sum = sizeof (data) / sizeof (data[0]);
	if ((sizeof (sum) <= sizeof (NumType)) && (sum <= LIMIT) && (sum > 1))
		MergeSort(data, sum);

	puts("\n\n归并排序后:\n");
	for (i = 0; i < LIMIT; ++i)
	{
		printf("%-5d\t", data[i]);
		if (i % 10 == 9)
			putchar('\n');
	}
	putchar('\n');
	getch();

	return 0;
}

/******************************以上代码仅供测试******************************/

// 归并排序

void Merge(DataType * const data, DataType * result, const NumType low, const TYPE CutOffPoint, const TYPE high)

{

#define FLAG 0 // FLAG = 0 升序排列	FLAG = 1 降序排列

	// if ((high + 1 <= LIMIT) && (high + 1 > 1))

	if ((high + 1 <= LIMIT) && (high + 1 > 1))

	{

		NumType i = low, j = CutOffPoint + 1, k = low;

		while (i <= CutOffPoint && j <= high)

#if !FLAG // FLAG == 0

			result[k++] = (data[i] <= data[j]) ? data[i++] : data[j++];

#elif FLAG // FLAG == 1

			result[k++] = (data[i] >= data[j]) ? data[i++] : data[j++];

#endif

		while (i <= CutOffPoint)

			result[k++] = data[i++];

		while (j <= high)

			result[k++] = data[j++];

	}

}

void MergePass(DataType * const data, DataType * result, const NumType sum, const TYPE len)

{

	NumType i = 0, j;

	// while (i + 2 * len < sum)

	while (i + (len << 1) < sum)

	{

		// Merge(data, result, i, i + len - 1,  i + 2 * len - 1);

		Merge(data, result, i, i + len - 1, i + (len << 1) - 1);

		// i = i + 2 * len;

		i += len << 1;

	}

	if (i + len < sum) // 一个长len，另一个不足len

		Merge(data, result, i, i + len - 1, sum - 1);

	else // 只剩一个长度不超过len

	for (j = i; j < sum; ++j)

		result[j] = data[j];

}

void MergeSort(DataType * const data, const NumType sum)

{

	TYPE len = 1;

	DataType * temp = (DataType *)malloc(sum * sizeof (DataType));

	while (len < sum)

	{

		MergePass(data, temp, sum, len);

		// len = 2 * len;

		len <<= 1;

		MergePass(temp, data, sum, len);

		// len = 2 * len;

		len <<= 1;

	}

	// 此处可作调试使用

	// printf("\n\n归并后，有序段(len)长:%4hu\n\n", len);

	free(temp);

}