说明：  插入排序算法1.for 循环找出一个待比较的值，然后进入while循环中，与数组中下标比它小的数据进行比较， * 因为下标比它小的数据都是排好序的，当a[i]大于这个数时，将a[i]往后移一下，就是这个数 * 的下标加1，依次循环，将比这个数的的数都移动到此数的后面，假如：当执行i--后，while条件 * 不成立，从而退出了while循环，此时，下标为i的数组值小于这个标准数，所以将这个标准数放到 * 下标为i+1的数组中。当for循环结束时，此数组中的所有元素都是有序的
(Insertion Sort algorithm to find a 1.for cycle value to be compared, and then enter a while loop, and the array subscript smaller than its comparison of data,* because it is smaller than under the standard data are sorted, When a [i] greater than this number, it will be a [i] backward look, that is, the number of* the subscript plus 1, followed by cycle, than the number of the numbers are moving back to this number, if : When running i- later, while condition* is not set up to exit the while loop, this time, the subscript i in the array is less than the standard number, so the number of this standard into* the subscript i+1 array. When the for loop ends, all the elements in this array are ordered)