{
int i,i1,i2;
i = i1 = i2 = 0;
while((i1<count1) && (i2<count2))
{
{
i1++;
}
if (i1<count1)
{
{
i2++;
}
}
}
free(temp);
}
{
if (count==1) return;
MergeSort(tab,count/2);
MergeSort(tab+count/2,(count+1)/2);
Mix(tab,tab+count/2,count/2,(count+1)/2);
}複製代碼