国外算法设计与分析课件05.pptVIP

Divide and Conquer Merge sort and quick sort Binary search Multiplication of large integers Strassen’s Matrix Multiplication Closest pair problem Expected Outcomes Students should be able to Explain the idea and steps of divide and conquer Explain the ideas of mergesort and quicksort Analyze the time complexity of mergesort and quicksort algorithms in the best, worst and average cases Divide and Conquer A successful military strategy long before it became an algorithm design strategy Coalition uses divide-conquer plan in Fallujah, Iraq. By Rowan Scarborough and Bill Gertz, THE WASHINGTON TIMES Example: Your instructor give you a 500-question assignment today and ask you to turn it in the tomorrow. What should you do? Three Steps of The Divide and Conquer Approach The most well known algorithm design strategy Divide the problem into two or more smaller subproblems. Conquer the subproblems by solving them recursively. Combine the solutions to the subproblems into the solutions to the original problem. An Example: Calculating a0 + a1 + … + an-1 Master Theorem Idea of Mergesort The Mergesort Algorithm The Merge Algorithm Mergesort Examples 8 3 2 9 7 2 5 4 7 2 1 6 4 Would you like to play a game? Real people animation of mergesort Volunteers is needed! Try to answer the following questions? How many key comparisons needed? How much extra memory needed? Is the algorithm an in-place algorithm? Is the algorithm stable? Analysis of Mergesort Number of basic operations (key comparisons): T(n) = 2T(n/2) + ?(n) Worst case and best case T(n) = 2T(n/2) + n-1 T(n) = 2T(n/2) + n/2 All cases: Θ(n log n) Space complexity: ?(n), not in-place Stable The Divide, Conquer and Combine Steps in Quicksort Divide: Partition array A[l..r] into 2 subarrays, A[l..s-1] and A[s+1..r] such that each element of the first array is ≤A[s] and each element of the second array is ≥ A[s]. (computing the index of s is part of partition.) Implication: A[s] will be in its final position in th