Introduction - If you have any usage issues, please Google them yourself
Hefei University of the data structure test eight Sort
Including the complete experimental requirements prelab report, final report experimental
Experimental requirements:
<1> to observe rapid sorting experiments compare and exchange a number of elements, and analysis of the functional relationship between the size of the data and the initial characteristics and compare and exchange times using different experimental data.
<2> Complete the following features: an integer array to adjust for this array: all multiples on the far left, all divided by 3 more than a number in the middle, and all 3 I 2 divided by the number in the rightmost. The time of the algorithm is as little as possible.
<3> shell sort algorithm, observed during the sequencing data comparison and the number of moves in different step selection method.
<4> chain radix sort integer table (assuming that each element of a maximum of three) sort.
<5> design algorithm to achie