西安电子科技大学计算机学院算法分析与设计 Chapter6.pdfVIP

Design and Analysis of Algorithms Heaps and Heapsort Reference: CLRS Chapter 6 Topics: • Heaps • Heapsort • Priority queue Huo Hongwei 1 Recap and overview • The story so far . . . 2 – Insertion sort running time of Θ(n ); 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