insertion_sort.c

#include <stdio.h>
#include<time.h>

void sort(int array[15],int n)
{
    //int n = sizeof(array) / sizeof(int),
    int c, d, t;
    printf("%d\n", n);
    for (c = 1; c <= n - 1; c++) {
        d = c;

        while (d > 0 && array[d] < array[d - 1]) {
            t = array[d];
            array[d] = array[d - 1];
            array[d - 1] = t;

            d--;
        }
    }
}

int main()
{
  int n, array[15], c, d, t;
  srand(time(NULL));
  int i = 0;
  for (int i = 0; i < 5; i++)
  {
      array[i] = rand();
  }
  n = sizeof(array) / sizeof(int);
  //printf("\n %d integers\n", n);


  sort(array,n);

  printf("Sorted list in ascending order:\n");

  for (c = 0; c <= n - 1; c++) {
    printf("%d\n", array[c]);
  }
  getch();
  return 0;
}