Merge Sort

#include <stdio.h>
#include <conio.h>

void main( )
{
    int a[5] = { 11, 2, 9, 13, 57 } ;
    int b[5] = { 25, 17, 1, 90, 3 } ;
    int c[10] ;
    int i, j, k, temp ;

    clrscr( ) ;

    printf ( \"Merge sort.\\n\" ) ;

    printf ( \"\\nFirst array:\\n\" ) ;
    for ( i = 0 ; i <= 4 ; i++ )
        printf ( \"%d\\t\", a[i] ) ;

    printf ( \"\\n\\nSecond array:\\n\" ) ;
    for ( i = 0 ; i <= 4 ; i++ )
        printf ( \"%d\\t\", b[i] ) ;

    for ( i = 0 ; i <= 3 ; i++ )
    {
        for ( j = i + 1 ; j <= 4 ; j++ )
        {
            if ( a[i] > a[j] )
            {
                temp = a[i] ;
                a[i] = a[j] ;
                a[j] = temp ;
            }
            if ( b[i] > b[j] )
            {
                temp = b[i] ;
                b[i] = b[j] ;
                b[j] = temp ;
            }
        }
    }

    for ( i = j = k = 0 ; i <= 9 ; )
    {
        if ( a[j] <=  b[k] )
            c[i++] = a[j++] ;
        else
            c[i++] = b[k++] ;

        if ( j == 5 || k == 5 )
            break ;
    }

    for ( ; j <= 4 ; )
        c[i++] = a[j++] ;

    for ( ; k <= 4 ; )
        c[i++] = b[k++] ;

    printf ( \"\\n\\nArray after sorting:\\n\") ;
    for ( i = 0 ; i <= 9 ; i++ )
        printf ( \"%d\\t\", c[i] ) ;

    getch( ) ;
}