国外算法设计与分析课件06 .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 ideas of binary search, multiplication of large integers, and Strassen’s matrix multiplication algorithms Analyze the time complexity of the above algorithms Binary Search an Iterative Algorithm Very efficient algorithm for searching in sorted array: K vs A[0] . . . A[m] . . . A[n-1] If K = A[m], stop (successful search); otherwise, continue searching by the same method in A[0..m-1] if K A[m] and in A[m+1..n-1] if K A[m] ALGORITHM BinarySearch(A[0..n-1], K) l ? 0; r ? n-1 while l ? r do // l and r crosses over? can’t find K m ? ??(l+r)/2? if K = A[m] return m //the key is found else if K A[m] r ? m-1 //the key is on the left half of the array else l ? m+1 // the key is on the right half of the array return -1 Binary Search – a Recursive Algorithm ALGORITHM BinarySearchRecur(A[0..n-1], l, r, K) if l r return –1 else m ? ?(l + r) / 2? if K = A[m] return m else if K A[m] return BinarySearchRecur(A[0..n-1], l, m-1, K) else return BinarySearchRecur(A[0..n-1], m+1, r, K) Analysis of Binary Search Worst-case (successful or fail) : Cw (n) = 1 + Cw( ?n/2? ), Cw (1) = 1 solution: Cw(n) = ? log2 n? +1 = ?log2(n+1)? This is VERY fast: e.g., Cw(106) = 20 Best-case: successful Cb (n) = 1, fail Cb (n) = ? log2 n? +1 Average-case: Consider the searching process as a binary tree. In looking at the binary tree, we see that there are i comparisons needed to search 2i-1 elements on level i of the tree. For a list with n = 2k-1 elements, there are k levels in the binary tree. The average case for all successful search: Represent binary search as a binary tree: Remarks on Bin