Description: Problem Description: merge sort, insertion sort, shell sort, quick sort, bubble sort, bucket sort algorithm
Experimental requirements:
To sort samples N = 10, 1000,10000 0 the space size in the randomly generated respectively
(The value of [0,1]) to test the above algorithm.
B. Output:
1) N = 10, sort results. 2) N = 1000,10000,100000 same sample instance, a different sort to complete the necessary time. 3) N = 1000,10000,100000 each sort more different samples to test a few times (a minimum of 5 times) to arrive at the average time, average time to compare different sorting algorithms.
To Search:
File list (Check if you may need any files):
实验一排序
..........\实验一报告.doc
..........\排序.cpp
..........\排序.exe
Download