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

* * 2010-2011-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 * * 2010-2011-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? Dis