归并排序用一个函数

归并排序再也不用两个函数了

void msort(int a[], int tmp[], int start, int end) {
    int p;
	int mid = (start + end) >> 1;
    if (start < end) {
		msort(start, mid);
		msort(mid + 1, end);
	}
	else return;	//递归出口
	
	//两边排序完成 归并
	int i = start, j = mid + 1, k = l;
    while (i <= mid && j <= end)
        if (a[i] > a[j])  tmp[k++] = a[i++];
        else              tmp[k++] = a[j++];
    while (i <= mid) 
		tmp[k++] = a[i++];
    while (j <= end) 
		tmp[k++] = a[j++];
	
    for (p = start; p <= end; p++) 
		a[p] = tmp[p];
}