有一个已经有序的数据序列，要求在这个已经排好的数据序列中插入一个数，但要求插入后此数据序列仍然有序，这个时候就要用到一种新的排序方法——插入排序法,插入排序的基本操作就是将一个数据插入到已经排好序的有序数据中,从而得到一个新的、个数加一的有序数据，算法适用于少量数据的排序，时间复杂度为O(n^2)。是稳定的排序方法。插入算法把要排序的数组分成两部分：第一部分包含了这个数组的所有元素，但将最后一个元素除外，而第二部分就只包含这一个元素。在第一部分排序后，再把这个最后元素插入到此刻已是有序的第一部分里的位置-One has been ordered sequence of data in this row has been good data in the sequence to insert a number, but the orderly sequence of this data is still asked to insert this time is necessary to use a new sort- insertion sortmethod, the basic operation of the insertion sort is to insert a data to ordinal data that has been sorted, ordered data to get a new number plus one, the algorithm is suitable for the sort of small amounts of data, the time complexity isO (n ^ 2). Is a stable sort. Insertion algorithm to sort an array is divided into two parts: The first section contains all the elements of the array, but excluding the last element, while the second part contains only one element. In the first part of the sort, and then this last element is inserted into the moment has ordered the first part of the location of