归并排序法

归并排序法

做好两点，把他分次两个小模块，分开治理，

  把两个模块又重新合并，排序，进行递归

#include <stdlib.h>
#include <stdio.h>
#include <iostream>
using namespace std;

#define N_MAx 10
//将有二个有序数列a[first...mid]和a[mid...last]合并。
void mergearray(int a[], int first, int mid, int last, int temp[])
{
	int i = first, j = mid + 1;
	int m = mid,   n = last;
	int k = 0;

	while (i <= m && j <= n)
	{
		if (a[i] <= a[j])
			temp[k++] = a[i++];
		else
			temp[k++] = a[j++];
	}

	while (i <= m)
		temp[k++] = a[i++];

	while (j <= n)
		temp[k++] = a[j++];

	for (i = 0; i < k; i++)
		a[first + i] = temp[i];
}
void mergesort(int a[], int first, int last, int temp[])
{
	if (first < last)
	{
		int mid = (first + last) / 2;
		mergesort(a, first, mid, temp);    //左边有序
		mergesort(a, mid + 1, last, temp); //右边有序
		mergearray(a, first, mid, last, temp); //再将二个有序数列合并
	}
}

/*bool MergeSort(int a[], int n)
{
	int *p = new int[n];
	if (p == NULL)
		return false;
	mergesort(a, 0, n - 1, p);
	delete[] p;
	return true;
}*/

void PrintArr(int ar[], int b )
{
	int i;
	for (i=0;i<b;i++)
	{
		cout<<ar[i]<<" ";
	}
	cout<<endl;
}

int main()
{
	//int ar[MAx];
	int ar[N_MAx]={78,14,2,58,69,100,50,26,65,97};
	int temp[N_MAx]={0};
	cout<<"排序前原数组"<<endl;
	PrintArr(ar, N_MAx);  
	mergesort(ar,0,N_MAx-1,temp);
    PrintArr(temp, N_MAx-1);  
	return 0;
}