Introduction - If you have any usage issues, please Google them yourself
The basic idea is to direct insertion sort (Straight Insertion Sorting): n be sorted elements seen as an ordered table and an unordered list, beginning orderly table contains only one element, unordered list containing n-1 elements, the sorting process every time removed from the unordered list, the first element, and insert it into the appropriate location in the ordered table, into a new order table, repeat n-1 to be completed by the sort process.