算法课件全121301ADA11减治法减可变规模算法.pptVIP

2007-2008-01《Design and Analysis of Algorithms》SCUEC Goals of the Lecture At the end of this lecture, you should Understand what’s selection problem and master the partition based algorithm for finding the kth smallest elements Master the basic idea of interpolation search and know the differences between binary search and interpolation search Know how to solve the game of nim Selection Problem What’s selection problem? Find the kth element (direct idea) To find the kth smallest element, we could move the k smallest elements to the start of the list and then the kth smallest will be in location list[k] This involves finding the smallest element and moving it to the first place, then finding the second smallest element and moving it to the second place and so on Direct Idea Algorithm Direct Idea Algorithm Analysis We need to do k passes, thus giving Algorithms based on Variable-Size-Decrease Technique A faster algorithm is based on using the quicksort-like partition of the list. Let s be a split position obtained by a partition: Assuming that the list is indexed from 1 to n: If s = k, the problem is solved; if s k, look for the k-th smallest elem. in the left part; if s k, look for the (k-s)th smallest elem. in the right part. Tracing the Median / Selection Algorithm Example: 4 1 10 9 7 12 8 2 15 Here: n = 9, k = ?9/2? = 5 array index 1 2 3 4 5 6 7 8 9 4 1 10 9 7 12 8 2 15 4 1 2 9 7 12 8 10 15 2 1 4 9 7 12 8 10 15 --- s=3 k=5 9 7 12 8 10 15 9 7 8 12 10 15 8 7 9 12 10 15 --- s=6 k=5 8 7 7 8 --- s=k=5 Algorithms based on variable-size-decrease technique Fi