| 索引折半查找算法的研究与设计 |
| |
| 引用本文： | 邹国霞,唐建清.索引折半查找算法的研究与设计[J].计算机时代,2009(12):63-65. |
| |
| 作者姓名： | 邹国霞 唐建清 |
| |
| 作者单位： | 桂林航天工业高等专科学校,广西,桂林,541004 |
| |
| 摘 要： | 当前对有序数列查找常用二分查找，但是二分查找具有一定的约束性和特殊情况下的低效性，为此研究并设计了索引折半查找算法，理论上其平均查找效率优于二分查找的平均查找效率。对比实验验证了索引折半查找算法的良好性能。
|
| 关 键 词： | 二分查找 分块查找 平均查找长度 索引查找 |
Research and Design of Index Binary Search Algorithm |
| |
| ZOU Guo-xia,TANG Jian-qing.Research and Design of Index Binary Search Algorithm[J].Computer Era,2009(12):63-65. |
| |
| Authors: | ZOU Guo-xia TANG Jian-qing |
| |
| Affiliation: | ( Guilin College of Aerospace Technology, Guilin, Guangxi 541004, China) |
| |
| Abstract: | At present binary search is often used in sorted array, but binary search has certain constraints and inefficiency in special circumstances. For this reason index binary search algorithm is studied and designed, its average search efficiency is superior to that of binary search in theory. The comparative experiments have verified the good performance of index binary search algorithm. |
| |
| Keywords: | binary search block search average search length index search |
| 本文献已被 维普 万方数据 等数据库收录！ |
