文件名称:(paiixuu1
介绍说明－－下载内容均来自于网络，请自行研究使用
（1）对以下6种常用的内部排序算法进行比较：起泡排序、直接插入排序、简单易懂选择排序、快速排序、希尔排序、堆排序。（2）待排序表的表长不小于100；其中的数据要用伪随机数产生程序源码产生；至少要要用5组不同的输输入数据作比较；比较的指标为有关键字参加的比较次数与关键字的移动次数（关键字交换计为3次移动）。（3）最后要对结果作出简单易懂分析，包含对各组数据的出结果波动大小的解释。 可直接使
-(1) to compare the following six kinds of commonly used internal sorting algorithm: bubble sort, insertion sort, the straightforward selection sort, quick sort, shell sort, heap sort. (2) Subject to the table length of the sort table is not less than 100 which data to use a pseudo random number generating program source want to use at least five different output of input data for comparison indicators comparing keyword participate moving times of the number of comparisons with keywords (keyword exchange counts as 3 mobile). (3) Finally the results to make a straightforward analysis, including for each set of data out of the interpretation of the results fluctuate size. Directly to
-(1) to compare the following six kinds of commonly used internal sorting algorithm: bubble sort, insertion sort, the straightforward selection sort, quick sort, shell sort, heap sort. (2) Subject to the table length of the sort table is not less than 100 which data to use a pseudo random number generating program source want to use at least five different output of input data for comparison indicators comparing keyword participate moving times of the number of comparisons with keywords (keyword exchange counts as 3 mobile). (3) Finally the results to make a straightforward analysis, including for each set of data out of the interpretation of the results fluctuate size. Directly to
(系统自动生成,下载前可以参看下载内容)
下载文件列表
(paiixuu1\4.cpp
(paiixuu1