Introduction - If you have any usage issues, please Google them yourself
A sorting algorithm insertion sort in the sort algorithm, the number to be sorted is divided into two sections, wherein A is sorted number, B is not sorted number, the initial state, A is only one elements. The algorithm successively from B number is inserted into the corresponding position A, until the B number of take complete. Linked list representation of the insertion sort algorithm.