test cases for bubble sort

This article is a summary of some sort of data structure, including the analysis of the time and space complexity of various sorting methods, mainly from direct insertion, exchange (bubbling, fast), selection (direct selection, heap sorting) and merging four categories to analyze.Insert directly: Insert each record sequentially into a sorted ordered table to get a new, increased number of records 1 i i-1 is already in order, at this point the

Time limit: 1 seconds space limit: 32768KTitle Description:Sorts and outputs the n number of inputs.Input Description: The first line of input includes an integer n (1Output Description: There may be more than one set of test data, for each set of data, the sorted n integer output, followed by a space after each number. The result of each set of test data is one row.Input Example: 4 1 4 3 2Output Example: 1

leading to other cities are a target-city. The mission of Mr.dog is to start from a source-city and choose a route leading to a target-city through which he can get The maximum profit.InputThe input file includes several test cases.The first line of all test case contains 2 integersNandm(1≤N≤100000, 0≤m≤1000000) indicating the number of cities and roads.The nextNLines each contain a single integer. TheITh