void  MergeSort(int *A, int p, int r)

 {

     if(p < r)

     {

         int q = ( p + r ) / ;

         MergeSort(A, p, q);

         MergeSort(A, q + , r);

         Merge(A, p, q, r);

     }

 }

 void  Merge(int *A, int p, int q, int r)

 {

     int n1 = q - p + ;

     int n2 = r - q ;

     int *L1 = new int[ (n1 + ) * sizeof(int)];

     int *R1 = new int[ (n2 + ) * sizeof(int)];

     int iLoop;

     int jLoop;

     for(iLoop = ; iLoop != n1; ++iLoop)

     {

         L1[iLoop] = A[p + iLoop];

     }

     for( jLoop = ; jLoop != n2; ++jLoop)

     {

         R1[jLoop] = A[q + jLoop + ];

     }

     L1[n1 ] = INT_MAX;

     R1[n2 ] = INT_MAX;

     jLoop = ;

     iLoop = ;

     for (int kLoop = p; kLoop != r + ; ++kLoop)

     {

         if(L1[iLoop] <= R1[jLoop])

         {

             A[kLoop] = L1[iLoop++];

         }

         else

         {

             A[kLoop] = R1[jLoop++];

         }

     }

 　　delete L1;
　　　　delete R1;

 }