C语言之插入排序法

C语言之插入排序法

#include <stdio.h>
void insertionSort(int *arr, int len)
{
  int i, j, tmp;

  for (i = 1; i < len - 1; i++)
  {
    tmp = arr[i];
    for (j = i - 1; j >= 0 && arr[j] > tmp; j--)
    {
      arr[j + 1] = arr[j];
    }
    arr[j + 1] = tmp;
  }
}

void Print(int *arr, int len)
{
  for (int i = 0; i < len; i++)
  {
    printf("%d ", arr[i]);
  }
  printf("\n");
}

int main()
{
  //int arr[] = {96, 61, 18, 26, 55, 42, 4, 72, 83};
  int arr[] = {2, 5, 6, 4, 3, 7, 9, 8, 1, 0, 13};
  int len = sizeof(arr) / sizeof(int); //计算数组中的成员数

  Print(arr, len);
  insertionSort(arr, len);
  Print(arr, len);

  return 0;
}