国外算法设计与分析课件08.pptVIP

Decrease and Conquer Decrease and conquer technique Insertion sort DFS and BFS Topological sort Expected Outcomes Students should be able to Explain the idea and steps of decrease and conquer Explain the ideas of insertion sort, DFS, BFS, topological sort Analyze the time complexity of the above algorithms Decrease and Conquer Exploring the relationship between a solution to a given instance of (e.g., P(n) )a problem and a solution to a smaller instance (e.g., P(n/2) or P(n-1) )of the same problem. Use top down(recursive) or bottom up (iterative) to solve the problem. Example, n! A top down (recursive) solution A bottom up (iterative) solution Examples of Decrease and Conquer Decrease by a constant: the size of the problem is reduced by the same constant on each iteration/recursion of the algorithm. Insertion sort Graph search algorithms: DFS BFS Algorithms for generating permutations, subsets Decrease by a constant factor: the size of the problem is reduced by the same constant factor on each iteration/recursion of the algorithm. Binary search Fake-coin problems Variable-size decrease: the size reduction pattern varies from one iteration of an algorithm to another. Euclid’s algorithm A Typical Decrease by One Technique A Typical Decrease by a Constant Factor (half) Technique A Typical Divide and Conquer Technique What’s the Difference? Consider the problem of exponentiation: Compute an Decrease by one Bottom-up: iterative (brute Force) Top-down:recursive Divide and conquer: Decrease by a constant factor: Insertion Sort A decrease by one algorithm A bottom-up (iterative) solution A top-down (recursive) solution Insertion Sort: an Iterative Solution ALGORITHM InsertionSortIter(A[0..n-1]) //An iterative implementation of insertion sort //Input: An array A[0..n-1] of n orderable elements //Output: Array A[0..n-1] sorted in nondecreasing order for i ? 1 to n – 1 do // i: the index of the first element of the unsorted part. key = A[i] for j ? i – 1 to 0