[PPT模板]The Divide-and-Conquer Strategy.ppt

Data Compression and Multimedia Communication Lab. Divide-and-Conquer strategy Chapter 5 The Divide-and-Conquer Strategy Split the original problem into two subproblems Recursive solve these two subproblems by applying the divide- and-conquer strategy Merge the solutions of the two subproblems into a solution of the original problem Basic technique of Parallel programming Correctness is easily established Analysis is relatively easy T(n)=2T(n/2)+S(n)+M(n) n?c =b nc S(n):Split time M(n):Merge time b:the time to compute the answer directly for small inputs The Divide-and-Conquer Strategy E.g. find the maximum of a set S of n numbers The Divide-and-Conquer Strategy Time complexity: Assume n = 2k, T(n) = 2T(n/2)+1 = 2(2T(n/4)+1)+1 = 4T(n/4)+2+1 : =2k-1T(2)+2k-2+…+4+2+1 =2k-1+2k-2+…+4+2+1 =2k-1 = n-1 = O(n) A general divide-and-conquer algorithm Step 1: If the problem size is small, solve this problem directly; otherwise, split the original problem into 2 sub-problems with equal sizes. Step 2: Recursively solve these 2 sub-problems by applying this algorithm. Step 3: Merge the solutions of the 2 sub-problems into a solution of the original problem. A general divide-and-conquer algorithm Time complexity: where S(n) : time for splitting M(n) : time for merging b : a constant c : a constant quick sort – divide and conquer E.g. 29 14 15 1 6 10 32 12 S(n)=O(n) M(n)=1 Worst case: O(n2) Average case: O(nlogn) Best case: O(nlogn) Divide - equal size of two subproblems medium - O(n) (Prune-and-Search) merge sort – divide and conquer E.g. 29 14 15 1 6 10 32 12 S(n)=1 M(n)=O(n) T(n)=2T(n/2)+O(n)=O(nlogn) 2-D maxima finding problem Def : A point (x1, y1) dominates (x2, y2) if x1 x2 and y1 y2. A point is called a maxima if no other point dominates it Straightforward method : Compare every pair of points Time compl