归并排序例题/模版XMU1328hdu3743

 #include <stdio.h>  
    
 #include <stdlib.h>  
    
 #define MAXN 1000100  
    
 int input[MAXN] = {0};  
    
 int tmp[MAXN];   
    
 void merge(int left, int middle, int right)  
    
 {  
    
      int i, j, k;  
    
      i = left, j= middle+1, k = 1;  
    
      while(i<= middle && j <= right)  
    
      {  
    
            if(input[j] < input[i])  
    
            {  
    
                 tmp[k++] = input[j++];  
    
            }  
    
            else  
    
     {  
    
                 tmp[k++] = input[i++];  
    
     }  
    
      }  
    
      while(i <= mid