C++与数据结构实验指导教程1947(国外英文).docVIP

C++与数据结构实验指导教程1947(国外英文资料) 30, energy-saving, such as the analysis of the Tao Yuanming phase of doubt Experiment eight sorting First, the purpose and requirements of the experiment 1 master the sorting process of various sorting methods 2, to understand some sorting algorithm implementation (such as insert sort, select sorting, bubble sort, quick sort, heap sort, etc.) Two. Basic concepts Sorting is the process of rearranging a set of elements in an ascending or descending order according to the value of a domain (1) direct insertion sort First, the first records in the sorting table are ordered, and then the second records are inserted into the proper place in the ordered table, and the ordered table is added to the two elements Then insert the third records into the appropriate location in the ordered table, and so on, until the elements in the table are all in order (2) Hill sort Take an integer D, all records n divided into D sub sequences, all distance D records in the same sub series; implementation respectively in each sub sequence of direct insertion sort; and then narrow the interval D, repeat the sequence classification and sorting, until the last d = = 1, will all records in the same sequence in order so far (3) simply select sorting First select the smallest keyword records in all records, the exchange and the first record, and then select the key of minimum records in the rest of the record, exchange, and second records and so on, until all the completed record sorting (4) bubble sort In the sequence of records to be sorted, the key of the two adjacent records is successively compared from the first to be sorted, and if the order is reversed, the two records are exchanged In this way, after the comparison, the key record is exchanged to the last The above procedure is then executed on the previous n-1 record (5) quick sort In the records to be sorted sequence taken a record as the pivot, compared to it as a benchmark, will be divided into two sub seque