Description: Design a testing procedure based on comparing several internal sorting algorithms compare the number of keywords and mobile number in order to obtain an intuitive feeling. Basic requirements: (1) of the foaming sort, direct sequencing, a simple selection sort, quick sort, Hill sort, heap sort algorithm for comparison (2) to be a long table to sort the table not less than 1000, the table of data randomly generated at least 5 different sets of data for comparison, comparative indicators: the number of keywords compared to participate in the mobile number and keyword (keyword exchange recorded as 3 times the mobile) (3) output the results of the comparison.
To Search:
- [SortClass] - Includes 7 sorts of sorting algorithm
- [ds_kcsj_cxc] - data structure Sort demonstration system
- [experiment7.Rar] - several algorithm animation demonstratio
- [work_std] - functional modules work to achieve some
- [BSortTree] - Binary Sort Tree of several operations i
- [sort] - Using random functions to generate 30,00
- [sort] - This the data structure of the curriculu
- [neibupaixu] - Data structure course design, the intern
- [paixu] - (1) of the following six kinds of common
File list (Check if you may need any files):
1079113215赵宇迪
................\1079113215赵宇迪.doc
................\程序
................\....\Debug
................\....\实验5.cpp
................\....\实验5.dsp
................\....\实验5.dsw
................\....\实验5.ncb
................\....\实验5.opt
................\....\实验5.plg
Download