Description: A 3000 random integer, using the random function, using the selection sort, bubble sort, quick sort, merge sort, such as sorting methods are available for, and statistics of each sort on the amount of time.
2. The problem of the stones: N< is placed around a circular playground. To = 100), we will have order to merge into a pile of stones. Rules can be selected at a time of adjacent two merged into a new pile, and will be a heap of stones, new scores for the merger. A programming by the file into the stack number N and every stack stones (& lt; = 20).
(1) select a scheme to combine the stones, with the right to use the combination of N- 1, with the minimum total score;
(2) select a scheme to combine the stones, with the right to use the combination of N- 1, with the largest total score;
Curriculum design
File list (Check if you may need any files):
Download