算法设计(分治法-快速排序).pptVIP

2007-2008-01《Design and Analysis of Algorithms》SCUEC Review of last class Divide and Conquer technique The merge sort algorithm and its best-case, worst-case and average-case analysis 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 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] in