归并排序算法

#include <stdio.h>
//展示数组(声明)
void sort(int array[], int start, int end);
//归并排序(声明)
void show(int num[], int length);
int main(void)
{
  //初始化
  int array[] = {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);
}
//展示数组(声明)
void show(int num[], int length)
{
  for (int i = 0; i < length; i++)
  {
    printf("%3d", num[i]);
  }
  printf("\n");
}
//归并排序(定义)
void sort(int array[], int start, int end)
{
  //返回条件
  if (start == end)
  {
    return;
  }
  //定义左右边界
  int lstart = start, lend = (start + end) / 2, rstart = lend + 1, rend = end;
  //排序左
  sort(array, lstart, lend);
  //排序右
  sort(array, rstart, rend);
  //左右归并
  for (int i = rstart; i <= rend; i++)
  {
    int j = i - 1, tmp = array[i];
    while (array[j] > tmp && j >= 0)
    {
      array[j + 1] = array[j];
      j--;
    }
    array[j + 1] = tmp;
  }
}