09-10-01ADA07(分治法-快速排序).pptVIP

* * 2009-2010-01 《Design and Analysis of Algorithm》 SCUEC What are we doing here? What are we doing here? Evaluate the summation: b+b+…+b = b (n-1) The recurrence to be solved Since n-1n, 2b(n-1)/n 2b Analyzing Quicksort: Average Case What are we doing here? Distribute the summation This summation gets its own set of slides later * * 2009-2010-01 《Design and Analysis of Algorithm》 SCUEC How did we do this? Pick a large enough thatan/4 dominates ?(n)+b What are we doing here? Remember, our goal is to get T(n) ? an log n + b What the hell? We’ll prove this later What are we doing here? Distribute the (2a/n) term The recurrence to be solved Analyzing Quicksort: Average Case * * 2009-2010-01 《Design and Analysis of Algorithm》 SCUEC Analyzing Quicksort: Average Case So T(n) ? an log n + b for certain a and b Thus the induction holds Thus T(n) = Θ(nlogn) Thus quicksort runs in Θ(nlogn) time on average (phew!) Oh yeah, the summation… 2009-2010-01 《Design and Analysis of Algorithm》 SCUEC 2007-2008-01《Design and Analysis of Algorithms》SCUEC * * 2009-2010-01 《Design and Analysis of Algorithm》 SCUEC Review of last class Divide and Conquer technique The merge sort algorithm and its best-case, worst-case and average-case analysis Divide And Conquer (II) Chapter 4 Application to sorting problem Quick sort * * 2009-2010-01 《Design and Analysis of Algorithm》 SCUEC Goals of the Lecture At the end of this lecture, you should Master the idea of quick sort algorithm Master the best-case, worst-case and average-case analysis of quick sort algorithm Understand the difference between merge sort and quick sort * * 2009-2010-01 《Design and Analysis of Algorithm》 SCUEC Quicksort Another sort algorithm example to reveal the essence of divide-and-conquer technique Its idea can be described as follows: Divide: Partition the array A[p..r] into two sub arrays A[p..q] and A[q+1..r] Invariant: All elements in A[p..q] are less than all elements in A[q+1..r] Conquer: Sort t