合肥工业大学数据结构试验八排序



包括完整的实验要求、实验预习报告、实验最终报告



实验要求：



<1>采用不同实验数据来观察快速排序的实验中比较和交换元素的次数，并分析数据的规模和初始特性与比较与交换次数之间的函数关系。



<2> 完成下面功能：将一个整型数组调整为这样的数组：所有３的倍数在最左边，所有除以３余１的数在中间，而所有除以３余２的数在最右边。要求算法的时间尽可能少。



<3> 实现shell排序算法，并观察在采用不同的步长选取方法对排序过程中数据的比较和移动次数的影响。



<4> 按链式基数排序的方法实现对整数表（假设每个元素最多为三位）的排序。



<5> 设计算法实现树形选择排序，要求能用数组和树来演示排序过程，以清晰地表示出排序过程。



<6>以数组和二叉树形式动态演示堆排序算法的排序过程。-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