Insertion Sort

Insertion Sort

Insertion sort iterates, consuming one input element each repetition, and growing a sorted output list. Each iteration, insertion sort removes one element from the input data, finds the location it belongs within the sorted list, and inserts it there. It repeats until no input elements remain.

Insertion Sort algorithm example in C programming :

#include <stdio.h>

int main() {

  int n, array[1000], c, d, t;

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

  printf("Enter %d integers\n", n);

  for (c = 0; c < n; c++) {

    scanf("%d", &array[c]);

  }

  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--;

    }
  }

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

  for (c = 0; c <= n - 1; c++) {

    printf("%d\n", array[c]);

  }

  return 0;
}

OUTPUT

Enter number of elements
4
Enter 4 integers
3
56
65
3
Sorted list in ascending order:
3
3
56
65