归并排序

//归并排序时一种简单易懂的高级排序方法，这里的归并是指将两个有序的子序列合并为一个新的有序的序列。最后的结果的将一个n元素序列分为序列长度为1的子序列，然后两两归并。又称2——路归并。如果每次将三个有序的序列归并叫3--路归并。时间复杂度为nLOGn。
直起归基时稳定的排序方法；简快堆希是不稳定的算法；
#include <stdio.h>
#include <stdlib.h>

void simplemerging(int array[],int arraynew[],int low, int mid, int high);
void merginghelp(int array[], int arraynew[],int low,int high);
void mergingsort(int array[],int number);

int main()
{
		int i,count;
		printf("please input the number of your data:\n");
		scanf("%d",&count);
		int array[count];
		printf("please input number:\n");
		for(i=0;i<count;i++)
				scanf("%d",&array[i]);
		printf("before sort:\n");
		for(i=0;i<count;i++)
				printf("%d ",array[i]);
		printf("\n");

		mergingsort(array,count);

		printf("after sort:\n");
		for(i=0;i<count;i++)
		{
				printf("%d ",array[i]);
		}
		printf("\n");
}

void mergingsort(int array[],int number)
{
		int *arraynew=(int *)malloc(sizeof(int)*number);
	//	int arraynew[number]; 
		merginghelp(array,arraynew,0,number-1);
		free(arraynew);
}
void merginghelp(int array[],int arraynew[],int low, int high)
{
		if(low<high)
		{
				int mid=(low+high)/2;
				merginghelp(array,arraynew,low,mid);
				merginghelp(array,arraynew,mid+1,high);
				simplemerging(array,arraynew,low,mid,high);
		}
}
void simplemerging(int array[],int arraynew[],int low, int mid, int high)
{
	int i,j,k;
	for(i=low,j=mid+1,k=low;i<=mid && j<=high;k++)
	{
			if(array[i]<=array[j])
			{
					arraynew[k]=array[i];
					i++;
			}
			else 
			{
					arraynew[k]=array[j];
					j++;
			}
	}

	for(;i<=mid;i++,k++)
	{
			arraynew[k]=array[i];
	}

	for(;j<=high;j++,k++)
	{
			arraynew[k]=array[j];
	}

	for(i=low;i<=high;i++)
	{
			array[i]=arraynew[i];
			printf("%d ",array[i]);
	}
	printf("\n");
}

#include <iostream>
#include <iomanip>
using namespace std;
 void sorthelp(int data[],int low,int mid,int high);
  void  sortdigui( int data[],int low,int high);
   void guibing(int data[],int n);
int main()
{
    int number;
    cout<<"请输入你要输入的数据的个数"<<endl;
    cin>>number;
    int data[number];
    cout<<"请输入你要排序的"<<number<<"个数据"<<endl;
    for(int i=0;i<number;i++)
    {
        cin>>data[i];
    }
    cout<<"请确认的数据："<<endl;
     for(int i=0;i<number;i++)
    {
        cout<<data[i]<<setw(5);
    }
    cout<<endl;
     guibing(data,number);
    cout<<"归并排序后的顺序是："<<endl;
     for(int i=0;i<number;i++)
    {
        cout<<data[i]<<setw(5);
    }

    }



 void sorthelp(int data[],int low,int mid,int high)
 {
    int i,j,k;
     int *numb= new int [high+1];
     for( i=low, j=mid+1, k=low;i<=mid&&j<=high;k++)
     {
         if(data[i]<=data[j])
         {
         numb[k]=data[i];
         i++;
      }
      else
      {
          numb[k]=data[j];
          j++;
     }

     }
     for(;i<=mid;i++,k++)
     {
         numb[k]=data[i];
     }
         for(;j<=high;j++,k++)
         {
             numb[k]=data[j];
         }
             for(i=low;i<=high;i++)
             {
                 data[i]=numb[i];
                 }
                 delete[]numb;

 }


 void  sortdigui( int data[],int low,int high)
 {
     if(low<high)
     {
         int mid=(low+high)/2;
         sortdigui(data,low,mid);
         sortdigui(data,mid+1,high);
         sorthelp(data,low,mid,high);
         }
     }



     void guibing(int data[],int n)
     {
         sortdigui(data,0,n-1);
         }