The lower bound of worst complexity is presented for any improved BFPET selecting algorithm based on median sequence.
本文对线性选择算法在比较算法类中给出了基于中值序列而设计的任何改进算法的复杂度下界；
The lower bound of worst complexity is presented for any improved BFPET selecting algorithm based on median sequence.
本文对线性选择算法在比较算法类中给出了基于中值序列而设计的任何改进算法的复杂度下界；
应用推荐