Practical C Programming

How to do it...

We will create a function for insertion sort called InsertionSort, which we will invoke as follows, where arr is the array to be sorted and consists of n number of elements.

Here are the steps that are followed in the InsertionSort method:

1. Initialize a variable, say i, to 1.
2. Repeat steps 2 to 5 n-1 times, that is, while i >= n-1. The value of i is incremented by 1 after every iteration, i=1,2,3 .... n-1.
3. Initialize a variable, j, to the value of i.
4. Repeat the following step 5  for j=i to j >=0. The value of j is decremented by 1 after every iteration, that is, j=i, i-1, i-2, ....0.
5. If arr[j] <arr[j-1], then interchange the values.

The program for sorting the elements of an integer array using the insertion sort technique ...