数据结构课程中查找算法的性能分析  

The Performance Analysis of Search Algorithms in Data Structures

作　　者：任平红[1] 陈矗[1] 

机构地区：[1]曲阜师范大学信息科学与工程学院,山东日照276826

出　　处：《电子技术（上海）》2016年第6期18-19,共2页Electronic Technology

摘　　要：数据结构是理论性很强的计算机专业基础课,涉及到很多算法,例如线性表、树表以及散列表的查找。一般的教学资料比较关注查找成功时的平均查找长度,而对查找失败时的情况讨论较少。文中通过举例对查找算法查找成功和查找失败时的效率进行了分析、对比和总结,对于查找算法的教学和学习有一定的借鉴作用。Data structure is a basic course of computer professional which is quite theoretical. The course contains a lot of algorithms, such as linear table search algorithm, tree table search algorithm, hash table search algorithm. General teaching materials tends to focus on the average successful search length while pays less attention to the average search length of failure. The writer has analyzed, compared and summarized the efficiency of the search algorithms both of success and failure. The above has certain reference for the teaching and learning of the algorithms

关 键 词：线性表查找 树表查找 散列表查找 平均查找长度 

分 类 号：TP311.12[自动化与计算机技术—计算机软件与理论]