算法分析和设计6.pptVIP

Chapter 6 Divide and Conquer The Divide and Conquer Paradigm 6.1 Introduction 6.2 Binary Search 6.3 Merge Sort 6.4 The Divide and Conquer Paradigm 6.5 Selection:Finding the Median and kth Smallest Element 6.6 Quick Sort 6.7 Multiplication of Large Integers 6.8 Matrix Multiplication 6.9 The Closest Pair Problem The Divide and Conquer Paradigm 6.1 Introduction 问题： 在序列A[1..n]中找最小和最大元素。 算法思想： 在序列A[1……n]中找最小和最大元素x,y [ if (n=2) 直接比较得结果; else 在序列A[1……mid]中找最小和最大元素x1,y1; 在序列A[mid+1…..n]中找最小和最大元素x2,y2; x=min{x1,x2}; y=max{y1,y2}; ] Algorithm 6.1