数据结构与算法国家级双语教学示范课程配套教材彭军向毅Chap10sorting课件教学.pptVIP

PPT研究院 POWERPOINT ACADEMY 外部排序:待排序记录的数量很大，以致内存一次不能容纳全部记录，在排序过程中尚需对外存进行访问的排序过程。 * Elements are floated up by comparing itself to the parent nodes, and exchanging values with parent nodes if it is greater than parent node values Last element eventually rise to the correct place in the heap by repeatedly exchanging child-parent keys and data. Build heap * The reheap down algorithm repairs a binary tree that satisfies the heap property except for the root node Root element is sinks down up the tree until it is in the correct location in the tree Root is sunk down by comparing itself to the child nodes, and exchanging values with child nodes if it is smaller than child node values * Index of 32 is 2, so the index of its left child (node 23) is (2 * 2 + 1) = 5. Index of right child (node 19) is 2 * 2 + 2 = 6. Right child index is 1 higher than left child index Index of 8 is 4, so the index of its parent (node 56) is lower limit of [(4 – 1) / 2] = 1 Total elements is 7, so the index of first leaf element (node 45) is lower limit of (7/2) = 3 Location of last nonleaf element (node 32) is 1 less than index of first leaf element: 3 – 1 = 2 * * The straight selection sort algorithm scans the unsorted elements arid selects the smallest element. Finding the smallest element among the n elements requires n - 1 comparisons. This part of the selection sort makes it very slow. Quadratic loop In heap sort, we reheap, which moves the largest element to the root by following tree branches. This ability to follow branches makes the heap sort much faster than the straight selection sort. * the increment is 3 After each pass through the data, the data in each segment are ordered. * First, recognize that no increment size is best for all situations. The overriding considerations in the sort are to complete the sort with the minimum number of passes (increments) and to minimize the number of elements that appear in more than one segment. One method to eliminate completely an elemen