Merge Sort

 #include<stdlib.h>
 #include<stdio.h>
 void Merge( int source[] , int temp[] , int start , int mid , int end )
 {
     int i = start , j = mid +  , k = start ;
     while ( i != mid +  && j != end +  )
     {
         if( source[i] > source[j] )
             temp[k++] = source[i++];
         else
             temp[k++] = source[j++];
     }
     while( i != mid +  )
         temp[k++] = source[i++];
     while( j != end +  )
         temp[k++] = source[j++];
     for( i = start ; i <= end ; i++ )
         source[i] = temp[i];
 }   //ÄÚ²¿Ê¹Óõݹé
 void MergeSort( int source[] , int temp[] , int start , int end )
 {
     int mid;
     if( start < end )
     {
         mid = ( start + end ) /  ;
         MergeSort( source , temp , start , mid );
         MergeSort( source , temp , mid+ , end );
         Merge( source , temp , start , mid , end );
     }
 }
 int main()
 {
     int a[]={,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,};
     int i,b[];
     MergeSort( a , b ,  , sizeof(a)/sizeof(a[])- );
     for( i =  ; i < sizeof(a)/sizeof(a[]) ; i++ )
         printf( "%d\t" , a[i] );
     printf("\n");
     return ;
 }

Merge

下面这种是总的写法：

 #include<stdio.h>
 #include<string.h>
 void Merge_Sort( int *a , int l , int r )
 {
     int len = r - l ;
     if( len <=  )  return;
     int mid = l + len/ ;
     Merge_Sort( a , l , mid ) ;
     Merge_Sort(a , mid, r);
     int p1 = l,p2 = mid;
     int temp[];
     for(int i = l ; i < r ; i++ )
     {
         if( p1 == mid)
         {
             temp[i] = a[p2];
             p2++;
         }
         else if( p2 == r)
         {
             temp[i] = a[p1];
             p1++;
         }
         else
         {
             if( a[p1] < a[p2] )
             {
                 temp[i] = a[p1];
                 p1++;
             }
             else
             {
                 temp[i] = a[p2];
                 p2++;
             }
         }
     }
     for(int i = l ; i < r ; i++ )
         a[i] = temp[i];
 }

 int main()
 {
     int n,i;
     int a[] ={,,,,,,,};

     Merge_Sort( a ,  , sizeof(a)/sizeof(int) );
     for( i =  ; i < sizeof(a)/sizeof(int) ; i++ )
         printf("%d ",a[i]);
     return ;
 }

Merge