归并算法

void PrintArr(int *arr, int n)
{
	if (!arr || n <= 0 ) return;
	for (int i=0; i<n; ++i)
	{
		std::cout << arr[i] << " ";
	}
	std::cout << std::endl;
	return;
}

void Merge(int *tmp_arr, int *data, int left, int mid, int right)
{
	if (!data || !tmp_arr) return;
	int left_index = left;
	int right_index = mid+1;
	int tmp_index = left;

	while (left_index <= mid && right_index <= right)
	{
		tmp_arr[tmp_index++] = data[left_index] >= data[right_index] ? data[left_index++] : data[right_index++];
	}

	while (left_index <= mid) tmp_arr[tmp_index++] = data[left_index++];
	while (right_index <= right) tmp_arr[tmp_index++] = data[right_index++];
	left_index = left;
	while (left_index <= right) data[left_index++] = tmp_arr[left_index];
	return;
}

void _MergeSort(int *dest, int *data, int left, int mid, int right)
{
	if (!data) return;
	if (left < mid) _MergeSort(dest, data, left, (left+mid)/2, mid);
	if (mid+1 < right) _MergeSort(dest, data, mid+1, (right+mid+1)/2, right);
	Merge(dest, data, left, mid, right);
	return;
}

void MergeSort(int *data, int data_size)
{
	if (!data || data_size <= 1) return;
	int *tmp_arr = (int *)malloc(data_size*sizeof(int));
	_MergeSort(tmp_arr, data, 0, (data_size - 1)/2, data_size - 1);
	for (int i=0; i<data_size; ++i)
	{
		data[i] = tmp_arr[i];
	}
	free(tmp_arr);
	return;
}



int _tmain(int argc, _TCHAR* argv[])
{
	std::cout << "hello" << std::endl;
	int arr[10] = {10, 5, 9, 4, 8, 3, 7, 2, 6, 1};
	PrintArr(arr, sizeof(arr)/sizeof(int));
	//InsertSort(arr, sizeof(arr)/sizeof(int));
	MergeSort(arr, sizeof(arr)/sizeof(int));
	PrintArr(arr, sizeof(arr)/sizeof(int));
	system("pause");
	return 0;
}