| 线性选择算法中递归参量的动态选择 |
| |
| 引用本文： | 武继刚,朱绍文.线性选择算法中递归参量的动态选择[J].西北民族学院学报,1994,15(1):18-20. |
| |
| 作者姓名： | 武继刚 朱绍文 |
| |
| 作者单位： | 烟台大学计算机系，西北民族学院物理系 烟台 264005，兰州 730030 |
| |
| 摘 要： | 通过对线性选择算法的递归分析,得出其子序列长度的最佳选择为19,可使原算法的复杂度降低60％;对分划支点的选择采用动态方法,使每步递归的复杂度最低,避免了原算法中的一刀切方法,使原算法得到较大改进。
|
| 关 键 词： | 选择算法 递归分析 算法复杂度 动态方法 |
Dynamic Selecting of Recursive Parameter in Linear Selecting Algorithm |
| |
| Wu Jigang.Dynamic Selecting of Recursive Parameter in Linear Selecting Algorithm[J].Journal of Northwest Minorities University(Natural Science ),1994,15(1):18-20. |
| |
| Authors: | Wu Jigang |
| |
| 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 . |
| |
| Keywords: | Selecting Algorithm Recursive Analysis Complexity Dynamic Method |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
