Introduction - If you have any usage issues, please Google them yourself
Insertion sort in the implementation, is usually used in place sorting (i.e., only need to sort of O (1) extra space). Therefore in the forward scan process and need to repeatedly to sort the elements gradually backward move, as the new element provides into space.