| 摘要: |
| 通过构造散列表和二分树,设计1个适用于大规模信息处理的快速动态查找算法,分析其执行效率,并给出程序及实验结果。 |
| 关键词: 映射 二分树 查找算法 |
| DOI： |
| 投稿时间：1997-06-16 |
| 基金项目:香港王宽诚教育基金会(9312004)和广西大学科研基金(S94314) |
|
| A Dynamic Search Algorithm and Its Experiment Based on Mapping and Binary Trees |
|
Zhong Cheng
|
| (Dept. of Computer Sci., Guangxi Univ., Nanning, 530004) |
| Abstract: |
| A dynamic searching algorithm applied in large information systems is designed by creating HASH table and some binary search trees,and its experiment is made on IBM Microcomputer. |
| Key words: mapping binary tree searching algorithm |
