CSC Design and Analysis of Algorithms

Transcription

1 CSC Design and Analysis of Algorithms Lecture 6 Divide and Conquer Algorithm Design Technique Divide-and-Conquer The most-well known algorithm design strategy: 1. Divide a problem instance into two or more smaller instances (ideally of about the same size) 2. Solve the smaller instances (usually recursively) 3. Obtain a solution to the original instance by combining these solutions to the smaller instances 2 1

2 Divide-and-Conquer Technique (cont.) a problem of size n subproblem 1 of size n/2 subproblem 2 of size n/2 a solution to subproblem 1 a solution to subproblem 2 a solution to the original problem 3 General Divide-and-Conquer Recurrence T(n) = at(n/b) + f (n) where f(n) Θ(n d ), d 0 Master Theorem: If a < b d, T(n) Θ(n d ) If a = b d, T(n) Θ(n d log n) If a > b d, T(n) Θ(n log b a ) Note: The same results hold with O instead of Θ Examples: T(n) = 4T(n/2) + n T(n)? T(n) = 4T(n/2) + n 2 T(n)? T(n) = 4T(n/2) + n 3 T(n)? 4 2

3 Recursion Tree (use for intuition) T(n) = at(n/b) + f (n) Visualize this as a recursion tree (branch factor a): Time Total time depends on how fast f(n) grows compared with the number of leaves (d compared with log b a) 5 Divide-and-Conquer Examples Sorting: mergesort and quicksort Binary tree traversals Binary search (?) Multiplication of large integers Matrix multiplication: Strassen s algorithm Closest-pair and convex-hull algorithms 6 3

4 Mergesort Split array A[0..n-1] in two about equal halves and make copies of each half in arrays B and C Sort arrays B and C recursively Merge sorted arrays B and C into array A as follows: Repeat the following until no elements remain in one of the arrays: compare the first elements in the remaining unprocessed portions of the arrays copy the smaller of the two into A, while incrementing the index indicating the unprocessed portion of that array Once all elements in one of the arrays are processed, copy the remaining unprocessed elements from the other array into A 7 Merging of Two Sorted Arrays 8 4

5 9 10 5

6

7

8

9

10 Analysis of Mergesort Recurrence for number of comparisons in the worst case: C(n) = 2 C(n/2) + C merge (n) = 2 C(n/2) + n-1 C(1) = 0 All cases have same efficiency: Θ(n log n) Space requirement: Θ(n) (not in-place) Can be implemented without recursion (bottom-up) 19 Quicksort Select a pivot (partitioning element) here, the first element Rearrange the list so that all the elements in the first s positions are smaller than or equal to the pivot and all the elements in the remaining n-s positions are larger than or equal to the pivot (see next slide for an algorithm) s p A[i] p Exchange the pivot with the last element in the first (i.e., ) subarray the pivot is now in its final position Sort the two subarrays recursively A[i] p 20 10

11 Two-Way (Hoar s) Partitioning Algorithm 21 Quicksort Example

12 Analysis of Quicksort Best-case time efficiency: split in the middle Θ(n log n) Worst-case time efficiency: sorted array! Θ(n 2 ) Average case time efficiency: random arrays Θ(n log n) Space efficiency: not in-place Θ(log n) with a careful implementation Not stable Improvements: better pivot selection: median-of-three partitioning switch to insertion sort on small subfiles or just stopping recursive calls when unsorted subarrays become small (say, <10 elements) and finish sorting with insertion sort These yields about 20% improvement Considered the method of choice for sorting random files of nontrivial sizes 23 Quicksort: Best Case 24 12

13 Quicksort: Worst Case 25 Quicksort: Average Case 26 13

14 Binary Tree Algorithms Binary tree is a divide-and-conquer ready structure! Ex. 1: Classic traversals (preorder, inorder, postorder) Algorithm Inorder(T) if T a a Inorder(T left ) b c b c print(root of T) d e d e Inorder(T right ) Formula for the number of extended nodes: x = n + 1 Efficiency: Θ(n) 27 Binary Tree Algorithms (cont.) Ex. 2: Computing the height of a binary tree T L T R h(t) = max{h(t L ), h(t R )} + 1 if T and h( ) = -1 Efficiency: Θ(n) 28 14

15 Multiplication of Large Integers Consider the problem of multiplying two (large) n-digit integers represented by arrays of their digits such as: A = B = The grade-school algorithm: a 1 a 2 a n b 1 b 2 b n (d 10 ) d 11 d 12 d 1n (d 20 ) d 21 d 22 d 2n (d n0 ) d n1 d n2 d nn Efficiency: n 2 one-digit multiplications 29 First Divide-and-Conquer Algorithm A small example: A * B where A = 2135 and B = 4014 A = ( ), B = ( ) So, A * B = ( ) * ( ) = 21 * (21 * * 40) * 14 In general, if A = A 1 A 2 and B = B 1 B 2 (where A and B are n-digit, A 1, A 2, B 1, B 2 are n/2-digit numbers), A * B = A 1 * B 1 10 n + (A 1 * B 2 + A 2 * B 1 ) 10 n/2 + A 2 * B 2 Recurrence for the number of one-digit multiplications M(n): M(n) = 4M(n/2), M(1) = 1 Solution: M(n) = n

16 Second Divide-and-Conquer Algorithm A * B = A 1 * B 1 10 n + (A 1 * B 2 + A 2 * B 1 ) 10 n/2 + A 2 * B 2 The idea is to decrease the number of multiplications from 4 to 3: (A 1 + A 2 ) * (B 1 + B 2 ) = A 1 * B 1 + (A 1 * B 2 + A 2 * B 1 ) + A 2 * B 2, I.e., (A 1 * B 2 + A 2 * B 1 ) = (A 1 + A 2 ) * (B 1 + B 2 ) - A 1 * B 1 - A 2 * B 2, which requires only 3 multiplications at the expense of (4-1) extra add/sub. Recurrence for the number of multiplications M(n): M(n) = 3M(n/2), M(1) = 1 Solution: M(n) = 3 log 2 n = n log 2 3 n Strassen s Matrix Multiplication Strassen observed [1969] that the product of two matrices can be computed as follows: C 00 C 01 A 00 A 01 B 00 B 01 = * C 10 C 11 A 10 A 11 B 10 B 11 = M 1 + M 4 - M 5 + M 7 M 3 + M 5 M 2 + M 4 M 1 + M 3 - M 2 + M

17 Formulas for Strassen s Algorithm M 1 = (A 00 + A 11 ) * (B 00 + B 11 ) M 2 = (A 10 + A 11 ) * B 00 M 3 = A 00 * (B 01 - B 11 ) M 4 = A 11 * (B 10 - B 00 ) M 5 = (A 00 + A 01 ) * B 11 M 6 = (A 10 - A 00 ) * (B 00 + B 01 ) M 7 = (A 01 - A 11 ) * (B 10 + B 11 ) 33 Analysis of Strassen s Algorithm If n is not a power of 2, matrices can be padded with zeros. Number of multiplications: M(n) = 7M(n/2), M(1) = 1 Solution: M(n) = 7 log 2 n = n log 27 n vs. n 3 of brute-force alg. Algorithms with better asymptotic efficiency are known but they are even more complex

18 Closest-Pair Problem by Divide-and-Conquer Step 1 Divide the points given into two subsets P l and P r by a vertical line x = m so that half the points lie to the left or on the line and half the points lie to the right or on the line. x = m d l d r 2d x d rectangle d d d = min{d l, d r } 35 Closest Pair by Divide-and-Conquer (cont.) Step 2 Find recursively the closest pairs for the left and right subsets. Step 3 Set d = min{d l, d r } We can limit our attention to the points in the symmetric vertical strip S of width 2d as possible closest pair. (The points are stored and processed in increasing order of their y coordinates.) Step 4 Scan the points in the vertical strip S from the lowest up. For every point p(x,y) in the strip, inspect points in in the strip that may be closer to p than d. There can be no more than 5 such points following p on the strip list! 36 18

19 Efficiency of the Closest-Pair Algorithm Recurrence for the Running time of the algorithm T(n) = 2T(n/2) + M(n), where M(n) O(n) By the Master Theorem (with a = 2, b = 2, d = 1) T(n) O(n log n) 37 Homework Reading: Chapter 5, Appendix B (pp ) Exercises: 5.1: 2, 6, 9 5.2: 1, 7, 8, 9 5.3: 2, 3, 8, : 2, 3 5.5: 2 Next: Transform and Conquer (Ch. 6) 38 19