Description: For any given sequence of integers, respectively, using direct insertion sort and bubble sort them in ascending order, the required output sorting process, that the results of each trip sorted. Bubble sort blistering front to back, that is the maximum number of each bubble to the final surface, and if there is no exchange of data blistering trip stop. Input requirements: the input data stored in input.txt, input.txt total of three lines, the first acts of the integer number of inputs, the first two acts of the input sequence of integers, and separated by a space, and the third row is empty. Output requirements: Output data stored in output.txt, the first output directly Sort results per trip, and then output a blank line, the final output of bubble sort results per trip, per trip results in line separator.
To Search:
File list (Check if you may need any files):
10.1\input.txt
....\output.txt
....\第十章参考答案一.c
10.1
Download