again we find and in an unsorted order we swap them again by the end of third iterationwe have sorted sub-list of items this process goes on until all the unsorted values are covered in sorted sub-list now we shall see some programming aspects of insertion sort algorithm now we have bigger picture of how this sorting technique worksso we can derive simple steps by which we can achieve insertion sort step if it is the first elementit is already sorted return step pick next element step compare with all elements in the sorted sub-list step shift all the elements in the sorted sub-list that is greater than the value to be sorted step insert the value step repeat until list is sorted pseudocode procedure insertionsorta array of items int holeposition int valuetoinsert for to length(ainclusive dovaluetoinsert [iholeposition while holeposition and [holeposition- valuetoinsert doa[holepositiona[holeposition- holeposition holeposition - end while [holepositionvaluetoinsert end for end procedure