有一个已经有序的数据序列，要求在这个已经排好的数据序列中插入一个数，但要求插入后此数据序列仍然有序，这个时候就要用到一种新的排序方法——插入排序法,插入排序的基本操作就是将一个数据插入到已经排好序的有序数据中，从而得到一个新的、个数加一的有序数据，算法适用于少量数据的排序，时间复杂度为O(n^2)。-There is an ordered sequence of data required to insert a number of good data sequence has been ranked, but asked to insert this data is still orderly sequence, this time is necessary to use a new sort- insertion sort law, the basic operations of insertion sort is a data inserted into the already sorted ordered data, so as to get a new number plus an ordered data, the algorithm is suitable for the sort of small amounts of data, the time complexity is O (n ^ 2).