Chap11 sorting.ppt

Data Structures and Algorithms Chapter 11: Sorting Electronic Information Engineering Chongqing University of Science and Technology May 2009 highlights 11-1 Sorting Concepts 11-2 Insertion Sorts 10-2-1 Straight Insertion Sort 10-2-2 Shell Sort 11-3 Selection Sorts 10-3-1 Straight Selection Sort 10-3-2 Heap Sort 11-4 Exchange Sorts 10-4-1 Bubble Sort 10-4-2 Quick Sort 11-5 External sorts Vocabulary 排序 sort 内部排序 internal sort 外部排序 external sort 插入排序 insertion sort 缩小增量排序 diminishing increment sort 选择排序 selection sort 堆排序 heap sort 快速排序 quick sort 归并排序 merge sort 基数排序 radix sort 平衡归并排序 balance merging sort 二路平衡归并排序 balance two-way merging sort 多步归并排序 ployphase merging sort 置换选择排序 replacement selection sort 11-1 Sorting Concepts One of the most common applications in computer science is sorting, the process through which data are arranged according to their values. Sorting algorithms are classified as internal or external Internal sort holds all data in primary memory during the sorting process External sort uses primary memory for data currently sorted, and secondary storage for data that did not fit in primary storage Sorting Concepts Contd Sort order may be ascending or descending Sort efficiency measures relative efficiency of the sort, estimating the number of comparisons and moves required to order an unordered list A Sort Pass traverses data through a portion or the entire list Sort stability indicates whether data with equal keys maintain relative input order in the output Sort stability 11-2 Insertion Sorts 11-2-1 Straight Insertion Sort 11-2-2 Shell Sort 11-2-1 Insertion sort concept Straight Insertion Sort in the straight insertion sort, the list at any moment is divided into sorted and unsorted sublists. In each pass, the first element of the unsorted sublist is inserted into the sorted sublist. Insertion sort example Algorithm Straight Insertion Sort algorithm insertionSort ref list , val last current 1 loop current last hold list[cu