Ming Li Talk about Bioinformatics明谈生物信息学.pptVIP

Lecture 11 Deterministic Selection The goal is to determine the ith smallest element from a list of n elements in linear time. No random numbers are used. The algorithm is due to Blum, Floyd, Pratt, Rivest, and Tarjan (1973). The idea is the same as RANDOMIZED-SELECT, but instead of choosing a partition randomly, we partition around an element that we have chosen very cleverly. Heres the idea: we split our list of n numbers into floor(n/5) groups of 5 elements, and one additional group of at most 4 elements. Then we sort each group of 5 elements, and find the median of each group of 5. This gives us a list of floor(n/5) medians. We now (recursively!) determine the median of these floor(n/5) medians, and call it x. This is the number we will partition around. Picture: n=27 smallest S S S S * * * * S S S S * * * * S S S x L L L * * * L L L L largest * * * L L L L Columns = 5 element groups. S x L Time Complexity: T(n) = T(n/5) + T(3n/4) + dn = O(n) – we will prove this by induction in class. Algorithm: select i-th smallest element SELECT(A,i) n := |A|; if n 60 then sort(A); return ith smallest element; else m := floor(n/5); divide A up into m groups of 5 elements; sort each of the m groups in ascending order; M := array of medians of each group; x := SELECT(M,ceil(m/2)); /* median of all the medians */ k := X-PARTITION(A,x); /* partition array A into elements ≤ x and elements x; return number of elements on low side of the partition */ if i = k then return x; else if (i k) then return SELECT(A[1..k-1],i); else return SELECT(A[k+1..n],i-k); More careful analysis There are floor(n/5) total columns in which 5 elements appear. Of these, at