Description: 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
To Search:
File list (Check if you may need any files):
insertsort.c
Download