Description: This procedure first array of a number of the 10 smallest sort and output the results. And then type to insert an integer n. Use a for statement to n and the array element-by-comparison, and if there are n> a [i] when a loop from the i following sequential elements in the value of a unit after the transfer. After the shift should be carried out after the move (from a [9] start to a [i] so far). Moved out after the end of outer circle. Insertion point for the i, to n to give a [i] can be. If all the elements to be inserted more than a few, it has not been carried out after the work shift. At this point i = 10, the result is n giving a [10]. The last cycle of the output of the array after inserting a few values of each element.
To Search:
File list (Check if you may need any files):
as.doc
Download