Divide-and-conquer课件.pptVIP

Divide-and-conquer Dr. Deshi Ye yedeshi@ Divide and Conquer分治法 Divide: the problem into a number of subproblems that are themselves smaller instances of the same type of problem. Conquer: Recursively solving these subproblems. If the subproblems are small enough, solve them straightforward. Combine: the solutions to the subproblems into the solution of original problem. Most common usage Break up problem of size n into two equal parts of size n/2. Solve two parts recursively Combine two solutions into overall solution in linear time. Which are more difficult? Sort Obviously application Sort a list of names. Organize an MP3 library. Display Google PageRank results. List RSS news items in reverse chronological order. Problems become easy once items are in sorted order Find the median. Find the closest pair. Binary search in a database. Identify statistical outliers. Find duplicates in a mailing list. Non-obvious applications Data compression. Computer graphics. Computational biology. Supply chain management. Book recommendations on Amazon. Load balancing on a parallel computer. Merge Sort John von Neumann 1945. Merging  two sorted arrays Merging  two sorted arrays Merging  two sorted arrays Merging  two sorted arrays Merging  two sorted arrays Merging  two sorted arrays Merging  two sorted arrays Merging  two sorted arrays Merging  two sorted arrays Merging  two sorted arrays Merging  two sorted arrays Analyzing merge sort Recurrence  for merge sort Recursion tree Recursion tree Recursion tree Recursion tree Recursion tree Recursion tree Recursion tree Recursion