Insertion sort

   #include <stdio.h>

main()
{
  int n, array[1000], c, d, t, flag = 0;

  printf("Enter number of elementsn");
  scanf("%d", &n);

  printf("Enter %d integersn", n);

  for (c = 0; c < n; c++)
    scanf("%d", &array[c]);

  for (c = 1 ; c <= n - 1; c++) {
    t = array[c];

    for (d = c - 1 ; d >= 0; d--) {
      if (array[d] > t) {
        array[d+1] = array[d];
        flag = 1;
      }
      else
        break;
    }
    if (flag)
      array[d+1] = t;
  }

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

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