将一个记录插入到已排序好的有序表中，从而得到一个新，记录数增1的有序表。即：先将序列的第1个记录看成是一个有序的子序列，然后从第2个记录逐个进行插入，直至整个序列有序为止。
要点：设立哨兵，作为临时存储和判断数组边界之用。(A record is inserted into a sorted ordered table to obtain a new ordered table with a record number increase of 1. That is, the first first sequences of the sequence are considered as an ordered subsequence, and then inserted from the second records one by one until the entire sequence is ordered.
Main points: set up sentry as temporary storage and judgment of array boundaries.)