【摘要】 通过对线性选择算法的递归分析,得出其子序列长度的最佳选择为19,可使原算法的复杂度降低60％;对分划支点的选择采用动态方法,使每步递归的复杂度最低,避免了原算法中的一刀切方法,使原算法得到较大改进。更多还原

【Abstract】 The optimum length of subsequence in linear selecting algorithm is presented in this paper by using recursive analysis, The complexity of improved algorithm used optimum length of subseqence is reduced by 60%. The spliting element is selected by dynamic method, The complexity of each recusive step is minimum, the running speed of old algorithm is improved .更多还原