1002.归并排序

题目：

分析：归并排序思想是分治法，首先运用递归让序列左半部分有序，再使右半部分有序。最后 把这两部分按大小进行归并，合成一个序列。

代码：

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

void merge(int *A, int start, int mid, int end);
void mergeSort(int *A, int start, int end);
void main()
{
	int i, n;
	scanf("%d", &n);
	int *A = (int *)malloc(sizeof(int) * n);
	for (i = 0; i < n; i++) scanf("%d", &A[i]);
	mergeSort(A, 0, n - 1);
	for (i = 0; i < n; i++)
		printf("%d\n", A[i]);
}

void mergeSort(int *A,int start,int end)
{
	if (start >= end) return;
	int mid = (start + end) / 2;
	mergeSort(A, start, mid);
	mergeSort(A, mid + 1, end);
	merge(A, start, mid, end);
}
//升序
void merge(int *A,int start,int mid,int end)
{
	int i, j, k;
	int *temp = (int *)malloc(sizeof(int) * (end - start + 1));
	for (i = start, j = mid + 1, k = 0; i <= mid && j <= end;)
	{
		if (A[i] > A[j])
		{
			temp[k++] = A[j];
			j++;
		}
		else
		{
			temp[k++] = A[i];
			i++;
		}
	}
	while (i <= mid)
	{
		temp[k++] = A[i++];
	}
	while (j <= end)
	{
		temp[k++] = A[j++];
	}
	for (i = 0; i < k; i++)
	{
		A[start + i] = temp[i];
	}
}