In the array implementation of lists, elements are stored into continuous locations. In order to add an element into the list at the end, we can insert it without any problem. But, assume if we desire to add the element at the starting or middle of the list, then we ought to rewrite all the elements after the position where the element ought to be added. We ought to shift (n)^th   element to (n+1)^th position, where 'n' refer to number of elements in the list. The (n-1)^thelement to (n)^th position  and it will continue till the ( r ) ^thelement to ( r + 1 )^th position, where 'r' refer to the position of insertion. For doing this, thecount will be incremented.

From the above instance, if we desire to add element '35' after element '33'. We ought to shift 77 to the 8^th position, 66 to the 7^th position, so on, 44 to the 5th position.

Before Insertion

Count    1     2            3               4               5                    6            7

Step 1

Count  1           2       3            4             5          6          7          8

Step 2

Count    1      2            3           4            5           6            7          8

Step 3

Count     1      2      3              4               5          6            7          8

Step 4

Count   1      2            3           4            5            6            7          8

Step 5

Count     1       2        3           4            5             6            7          8