归并排序算法

#include //展示数组(声明)voidsort(intarray[], intstart, intend);
//归并排序(声明)voidshow(intnum[], intlength);
intmain(void)
{
//初始化intarray[] = {5, 2, 4, 7, 1, 3, 2, 6},len=8;
printf("排序前:\n");
show(array, len);
//归并排序sort(array, 0, len-1);
printf("排序后:\n");
show(array, len);
}
//展示数组(声明)voidshow(intnum[], intlength)
{
for (inti=0; i<length; i++)
  {
printf("%3d", num[i]);
  }
printf("\n");
}
//归并排序(定义)voidsort(intarray[], intstart, intend)
{
//返回条件if (start==end)
  {
return;
  }
//定义左右边界intlstart=start, lend= (start+end) /2, rstart=lend+1, rend=end;
//排序左sort(array, lstart, lend);
//排序右sort(array, rstart, rend);
//左右归并for (inti=rstart; i<=rend; i++)
  {
intj=i-1, tmp=array[i];
while (array[j] >tmp&&j>=0)
    {
array[j+1] =array[j];
j--;
    }
array[j+1] =tmp;
  }
}