Describe: 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.

File list(Click to check if it's the file you need, and recomment it at the bottom):
  1079113215ÕÔÓîµÏ
  ................\1079113215ÕÔÓîµÏ.doc
  ................\³ÌÐò
  ................\....\Debug
  ................\....\ʵÑé5.cpp
  ................\....\ʵÑé5.dsp
  ................\....\ʵÑé5.dsw
  ................\....\ʵÑé5.ncb
  ................\....\ʵÑé5.opt
  ................\....\ʵÑé5.plg

 Downloaders recently:  153002296 wen530686500 904258864 sunnykaby [More information of uploader fychihaodong]

 [dissect.rar] - MFC source code easy to understand layman' s language and MFC on: majored Publisher: Huazhong University Press Page: 701 Publication Date: 2001 ISB
 [experiment7.Rar] - several algorithm animation demonstration, including Bubble Sort, select, in order of insertion sort, quick sort, heap sort, support single-step demon
 [SortClass.zip] - Includes 7 sorts of sorting algorithm

 [ds_kcsj_cxc.rar] - "data structure" Sort demonstration system. Six species of achieving internal order. Including direct insertion sort, Hill, in order Bubble
 [BSortTree.rar] - Binary Sort Tree of several operations including: the establishment of binary sort tree, insert node, delete node, node, such as Find. Data structure
 [paixu.rar] - (1) of the following six kinds of commonly used internal sorting algorithm to compare: foaming sort of direct insertion sort, selection sort simple, q
 [work_std.rar] - functional modules work to achieve some of the information involved mainly string handling, sorting algorithm, string inquiries, kmp improve dichotomy
 [sort.rar] - Using random functions to generate 30,000 random integers, the use of insertion sort, bubbling sort, select sort, quick sort, heap sort, merge sort an
 [neibupaixu.rar] - Data structure course design, the internal sorting algorithm of comparison, the value is very high, are endowed with the code and experimental reports
 [sort.rar] - This is the data structure of the curriculum design, sort of sparkling, direct sequencing, a simple selection sort, quick sort, Hill sort and heap sor