归并排序

//归并排序void Merge(FILE *merge, FILE *sort1, FILE *sort2, int len){int s1, s2;char c1, c2;c1 = getc(sort1);c2 = getc(sort2);s1 = 0;s2 = 0;while( 1 ){if( c1 < c2 ){putc(c1, merge);s1++;if( s1 < len ){c1 = getc(sort1);}else{break;}}else if( c1 > c2 ){putc(c2, merge);s2++;if( s2 < len ){c2 = getc(sort2);}else{break;}}}if( s1 < len ){putc(c1, merge);s1++;}if( s2 < len ){putc(c2, merge);s2++;}while( s1 < len ){c1 = getc(sort1);putc(c1, merge);s1++;}while( s2 < len ){c2 = getc(sort2);putc(c2, merge);s2++;}}