Algorithm InsertionSort(data[],n)

 

1. For pass = 1 to n-1

a. index = pass

b. place data[index] in correct position among data[0] . . data[pass]

2. End

 

Explanation

 

1. The algorithm for insertion sort requires a for loop and while loop.


2. The outer for loop must iterate once for each element in the data set (of size n) while the inner while loop executes swapping according to the elements which are placed in correct position in sorted portion


3. In Each pass , the next largest element of the data is moved to its proper place. Therefore, to get all n elements in their correct places, the outer loop must be executed n-1 times.


4. The inner loop is executed on each iteration of the outer loop.