09 01ada16变治法堆排序.pdf

Review of last class Transformation and Conquer technique and Its three major variations Gaussian Elimination method Horner’sRule 2008-2009-01 《Design and ysis of Algorithm》SCUEC 2020/12/3 2 Chapter 6 Transform and Conquer (II) ⚫ Its Application to Sort Problem ◼ Heap Sort Goals of the Lecture At of this lecture, you should • Be familiar with the concept and properties of heap • Master the heap sort algorithm and its ysis 2008-2009-01 《Design and ysis of Algorithm》SCUEC 2020/12/3 4 The concept of Heap Definition Given a list {r ,r , …,r }, we call this list as 1 2 n a heap if and only if the elements of the list satisfies: r ≤ r and r ≤ r , 1≤i ≤n/2 or satisfies: i 2i i 2i+1 r ≥ r and r ≥ r , 1≤i ≤n/2 i 2i i 2i+1 From the above definition, we can regard a heap as a binary tree which satisfied the followin o conditions: • Tree’sshape requirement: the binary tree is essentially complete, i.e., all its levels are full except possibly the last level, where only some rightmost keys may be missing • Parental dominance requirement: The element at each node is ≥elements at its children 2008-2009-01 《Design and ysis of Algorithm》SCUEC 2020/12/3 5 Illustration of the heap’s definition 10 10 10 5 7 5 7 5 7 4 2 1 2 1 6 2 1 a heap? ✓ a heap?  a heap?  Note: Heap’s elements are ordered to