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 + 1 , k = start ;
    while ( i != mid + 1 && j != end + 1 )
    {
        if( source[i] > source[j] )
            temp[k++] = source[i++];
        else
            temp[k++] = source[j++];
    }
    while( i != mid + 1 )
        temp[k++] = source[i++];
    while( j != end + 1 )
        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 ) / 2 ;
        MergeSort( source , temp , start , mid );
        MergeSort( source , temp , mid+1 , end );
        Merge( source , temp , start , mid , end );
    }
}
int main()
{
    int a[]={18,78,244,36,9,12,4,5,68,7,4,895,321,50,10,30,98,74,56,13,25,46,789,420,159,360,5648,78,1,2,3,6,98};
    int i,b[1000];
    MergeSort( a , b , 0 , sizeof(a)/sizeof(a[0])-1 );
    for( i = 0 ; i < sizeof(a)/sizeof(a[0]) ; i++ )
        printf( "%d\t" , a[i] );
    printf("\n");
    return 0;
}

 下面这种是总的写法：

#include<stdio.h>
#include<string.h>
void Merge_Sort( int *a , int l , int r )
{
    int len = r - l ;
    if( len <= 1 )  return;
    int mid = l + len/2 ;
    Merge_Sort( a , l , mid ) ;
    Merge_Sort(a , mid, r);
    int p1 = l,p2 = mid;
    int temp[10000];
    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[] ={10,45,32,69,52,10,58,15};

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