摘要
通过对几种改进的二分查找算法的分析和总结,提出了一种基于结点群的更为高效的动态二分查找器。该二分查找器不仅使查找效率得以提高,而且使存储结构得以改进,既实现了动态的实时查找,又便于灵活地进行元素尤其是元素群的插入、删除等操作。另外,实验表明,当在大量数据中查找时,该算法明显优于以前改进的所有二分查找算法。
Based on the analysis and summary of several improved binary search algorithm, we put forward a more highly efficient and dynamic binary searcher based on node group, which is not only improved in the search efficiency, but also in the storage structure. This algorithm has achieved the dynamic real-time search, and it especially allows to insert and delete a group of elements. In addition, we discovered that the scheme is obviously better than the previous binary search algorithm in searching a large amount o{ data.
出处
《计算机科学》
CSCD
北大核心
2013年第7期244-247,288,共5页
Computer Science
基金
国家自然科学基金项目(61273294)
山西省教育厅高校科技开发项目(20121108)
山西省科技厅基础条件平台项目(2012091003-0104)资助
