Understanding insertion sort algorithm

The strategy from the earlier example could be used to create an algorithm. To explain this algorithm, we will take an array as an input list, but the same algorithm can be applied to any list data structure.

Algorithm

Like bubble and selection sorts, insertion sort conceptually divides the input array into two subarrays: a sorted subarray and an unsorted subarray. Initially, the first element of the array is considered sorted.