快速选择算法

快速选择算法，就是从给定的一个集合S={a1,a2,...an}中选出第K个大小的数，或者给出其所在的下标之类的。

 

如果使用排序，然后返回第K个元素的下标，复杂度是O(NlogN)

如果使用quick sort的一个变种，叫 quick select，则平均复杂度为O(N)，最坏复杂度为O(N^2)

如果使用一种线性选择算法，则可以达到最坏O(N)的复杂度，不过实际应用中，该算法通常比quick select慢1到2倍，所以并不常用（参考Blum, Floyd, Pratt, Rivest, and Tarjan 1973  Time bounds for selection）

 

这里实现了stl风格的quick select，仅仅作为一个mark

 

 

#include <algorithm> #include <cassert> namespace algorithm { template<typename _Tp> const _Tp& choose_pivot(const _Tp& x, const _Tp& y, const _Tp& z) { if( (x < y && y < z)||(z < y && y < x) ) return y; else if( (z < x && x < y)||(y < x && x < z) ) return x; else return z; } template<typename _Tp,typename _Compare> const _Tp& choose_pivot(const _Tp& x, const _Tp& y,const _Tp& z, _Compare comp) { if( (comp(x,y) && comp(y,z))||(comp(z,y)&&comp(y,x)) ) return y; else if( (comp(z,x) && comp(x,y))||(comp(y,x)&&comp(x,z))) return x; return z; } template<typename _RandomAccessIterator,typename _Tp> _RandomAccessIterator quick_partition(_RandomAccessIterator first, _RandomAccessIterator last,_Tp pivot) { while( true ){ while( *first < pivot ) ++first; --last; while( pivot < *last ) --last; if( first >= last ) return first; std::swap(*first,*last); ++first; } } template<typename _RandomAccessIterator,typename _Tp, typename _Compare> _RandomAccessIterator quick_partition(_RandomAccessIterator first, _RandomAccessIterator last, _Tp pivot, _Compare comp) { while( true ){ while( comp(*first,pivot) == true ) ++first; --last; while( comp(pivot,*last) == true ) --last; if( first >= last ) return first; std::swap(*first,*last); ++first; } } template<typename _RandomAccessIterator> _RandomAccessIterator quick_select(_RandomAccessIterator first, _RandomAccessIterator last, size_t kth) { typedef typename std::iterator_traits<_RandomAccessIterator>::value_type _ValueType; typedef typename std::iterator_traits<_RandomAccessIterator>::difference_type _DistanceType; if( first == last || last-first <=(_DistanceType)kth )//out of range return last; _ValueType pivot; _RandomAccessIterator mid; while( true ) { if( kth == 0 ) return std::min_element(first,last); else if( first+kth == last - 1 ) return std::max_element(first,last); else{ mid = first+(last-first)/2; pivot = choose_pivot(*first,*mid,*(last-1)); mid = quick_partition(first,last,pivot); if( mid-first > (_DistanceType)kth ) last = mid; else{ kth -= mid-first; first = mid; } } assert( last-first > (_DistanceType)kth); } } template<typename _RandomAccessIterator,typename _Compare> _RandomAccessIterator quick_select(_RandomAccessIterator first, _RandomAccessIterator last, size_t kth,_Compare comp) { typedef typename std::iterator_traits<_RandomAccessIterator>::value_type _ValueType; typedef typename std::iterator_traits<_RandomAccessIterator>::difference_type _DistanceType; if( first == last || last-first <=(_DistanceType)kth )//out of range return last; _ValueType pivot; _RandomAccessIterator mid; while( true ) { if( kth == 0 ) return std::min_element(first,last,comp); else if( first+kth == last - 1 ) return std::max_element(first,last,comp); else{ mid = first+(last-first)/2; pivot = choose_pivot(*first,*mid,*(last-1),comp); mid = quick_partition(first,last,pivot,comp); if( mid-first > (_DistanceType)kth ) last = mid; else{ kth -= mid-first; first = mid; } } assert( last-first > (_DistanceType)kth); } } }