归并排序

#include <stdio.h>
//#include "common.h"
#include "iostream.h"
void merge(int data[], int p, int q, int r)
{        
 int i, j, k, n1, n2;        
 n1 = q - p + 1;        
 n2 = r - q;        
 int L[99];        
 int R[99];         
 for(i = 0, k = p; i < n1; i++, k++)                
  L[i] = data[k];        
 for(i = 0, k = q + 1; i < n2; i++, k++)                
  R[i] = data[k];        
 for(k = p, i = 0, j = 0; i < n1 && j < n2; k++)        
 {               
  if(L[i] > R[j])                
  {                        
   data[k] = L[i];                        
   i++;                
  }                
  else                
  {                        
   data[k] = R[j];                        
   j++;
  }    
 }   
 if(i < n1)        
 {                
  for(j = i; j < n1; j++, k++)                    
   data[k] = L[j];        
 }        
 if(j < n2)        
 {                
  for(i = j; i < n2; i++, k++)                        
   data[k] = R[i];        
 } 
}
void merge_sort(int data[], int p, int r)
{        
 if(p < r)        
 {                
  int q = (p + r) / 2;                
  merge_sort(data, p, q);                
  merge_sort(data, q + 1, r);                
  merge(data, p, q, r);        
 }
}
void test_merge_sort()
{      
 int data[] = {44, 12, 145, -123, -1, 0, 121};        
 printf("-------------------------------merge sort----------------------------\n");       
 //out_int_array(data, 7);       
 merge_sort(data, 0, 6);       
 //out_int_array(data, 7);
 for (int i=0;i<6;i++)
 {
  cout<<data[i];
 }
 
}
int main()
{       
 test_merge_sort();       
 return 0;

}