算法导论 第六章 堆排序.ppt

Heap sorting（堆排序） 主要内容 Overview Heap堆 Heap：a data structure which is an array object that can be viewed as a complete binary tree(完全二叉树) Describe storage堆的表示和存储 An array A that represents a heap is an object with two attributes: Length[A]----the number of elements in the arry A （数组A长度） Heap-size[A]----the number of elements in the heap stored within array A （存储在A中堆的元素个数） Heap-size[A] ≤Length[A] 大根堆、小根堆 There are two kinds of binary heaps: Max-heap Min-heap Max-heap----for every node i other than the root, A[PARENT(i)] ≥A[i] Min-heap----for every node i other than the root, A[PARENT(i)] ≤A[i] The root of the tree is A[1] Property 堆的性质 Given the index i of a node, the indices of its parent PARENT(i), left child LEFT(i), and right child RIGHT(i) can be computed simply: PARENT(i) return ?i/2? LEFT(i) return 2i RIGHT(i) return 2i + 1 思考题 6.1-5,6 6.2-1,6 6.3-1,3 * * （一种算法设计技术） Heap sorting堆排序 Priority queue优先队列 The story so far…(平衡！) --Insertion sort running time of Θ(n2); sorts in place --Merge sort running time of Θ(n lg n); needs auxiliary storage Θ(n). Next… --Heapsort running time of Θ(n lg n); sort in place. --Quicksort running time of Θ(n lg n) on average; most practical (and hence widely-used) sorting algorithm. --Sorting in linear time. Example of Max-heap 1 4 2 3 9 7 8 10 14 16 10 9 8 7 6 5 4 3 2 1 Heap Operations supported by a heap: MAX-HEAPIFY ensures that a heap is max heap. O(log n) To sort an array, we can first convert it into a max heap, repeatedly extract the root (the largest element by definition) and MAX-HEAPIFY the rest. Θ(n log n) Exercise. The height of heap with n elements is BUILD-MAX-HEAP produces a max heap from an unordered array. Θ(n) MAX-HEAPIFY (a) The initial with A[2] at node i = 2 violating the max-heap property (b) By exchange A[2] with A[4], which Destroys the max-heap property for node 4. Recursive call MAX-HEAPIFY(A,4) has i = 4… (c) MAX-HEAPFIFY(A,9) yields no furthe