算法课件全121301ADA06分治法合并排序.pptVIP

2007-2008-01《Design and Analysis of Algorithms》SCUEC Review of last class The string match algorithm and its best-case, worst-case and average-case analysis Goals of the Lecture At the end of this lecture, you should be able to Understand the divide-and-conquer technique Master the idea of merge sort algorithm Master the best-case, worst-case and average-case analysis of merge sort algorithm Example The brute force algorithm for above problem: Examples (cont.) Can we solve this problem much better? Improvement algorithm Improvement algorithm (cont.) Examples (cont.) Time complexity analysis of improvement algorithm The basic operation is comparison, so let T(n) denotes the comparisons. For simplicity, we assume n is a power of 2. When n=2, the algorithm do one comparison (by row 5); When n2, the algorithm do two recursive calls of n/2 elements (by row 16 and 17) and do two comparisons (by row 18 and 19). So we can get the recurrence relation as follow: Examples (cont.) Divide-and-Conquer Technique A powerful design technique that is used to solve a variety of problems, is probably the best-known general algorithm design technique. Its basic idea is that it divides the original problem into several subproblems and then get the solution of the original problem based on solving each subproblem one by one. General framework Divide the problem into a number of subproblems of smaller size (generally 2 subproblems) Conquer (solve) the subproblems. If the size is smaller than a threshhold, solve straightforward Otherwise, recursively invoke the algorithm Combine the solutions to obtain a solution for the original problem. Divide-and-Conquer Technique (cont.) Divide-and-Conquer Technique (cont.) Merge Sort Merge sort is a member of sorting problem, is an example algorithm that reveals the essence of divide-and conquer technique Its idea is Directly derived from divide and conquer Divide: divide the list {r1, r2, …, rn} into two equal length sublists {r1, r2, …, rn/2} an