归并排序分析

     

#include <iostream>
using namespace std;
void 	Merge(int *data,int start,int between,int end)
{
    int length1=between-start+2;
   int  length2=end-between+1;
      int Left[length1];
      int Right[length2];
      for(int i=0;i<length1-1;i++)
            Left[i]=data[start+i];
            Left[length1-1]=100000;
      for(int i=0;i<length2-1;i++)
          Right[i]=data[between+i+1];
          Right[length2-1]=100000;
          int i=0,j=0;
      for(int index=start;index<=end;++index)
            {
               if (Left[i]<=Right[j])
                 {
                    data[index]=Left[i++];
                 }