Data Structures（数据结构）Course 11 Advanced Sorting.ppt

* 西南财经大学天府学院 LOGO Data Structures(数据结构)Course 11: Advanced Sorting Vocabulary Sort (排序) Internal sort (内排序) External sort (外排序) Ascending order (升序) Descending order (降序) Insertion sort (插入排序) Straight insertion sort (直接插入排序) Shell sort (希尔排序) Selection sort (选择排序) Straight selection sort (直接选择排序) Heap sort (堆排序) Exchange sort (交换排序) Bubble sort (冒泡排序) Quick sort (快速排序) Stability (稳定性) Pass (一趟排序) Highlights in this chapter General sort concept Sort order Sort stability Sort efficiency passes Insertion sorts Selection sorts Exchange sorts 11-1 General sort concept Internal sort External sort Sort order Sort stability Sort efficiency passes All of data are held in primary memory during the sorting process. It are classified as : Insertion Sort Selection sort Exchange sort Merging sort Distribution sort Uses primary storage (内存) for the data currently being sorting and secondary storage (外存) for any data that will not fit in primary memory. Data may be sorted in either ascending or descending order. The sort order identifies the sequence of the data A measure of the relative efficiency of a sort. It is usually an estimate of the number of comparisons and moves required to order an unordered list. Each traversal of the during the sorting process. 11-2 Insertion sorts Insertion sort: in each pass of an insertion sort, one or more pieces of data are inserted into their correct location in an order list. In this section we study two insertion sorts, the straight insertion sort and the shell sort. Straight insertion sorts In the straight insertion sort, the list at any moment is divided into two sublists: sorted and unsorted. In each pass, the first element of the unsort sublist is transferred to the sorted sublist by inserting it at the appropriate place. Unsorted 23 45 78 8 32 56 After pass 2 Sorted Unsorted 8 23 45 78 32 56 After pass 3 Sorted 8 23 32 45 78 56 After pass 4 Sorted Unsorted 23 78 4