| 几种查找算法的比较 |
| |
| 引用本文： | 赵刚,李昆.几种查找算法的比较[J].科技信息,2010(9):152-152,168. |
| |
| 作者姓名： | 赵刚 李昆 |
| |
| 作者单位： | 南昌航空大学数学与信息科学学院,江西南昌330063 |
| |
| 摘 要： | 查找是在大量的信息中寻找一个特定的信息元素，在计算机应用中，查找是常用的基本运算，文中介绍四种查找算法，分别是顺序查找、二分查找、二叉排序树查找和哈希查找。并用JAVA语言编写了相应程序代码，比较了查找同一个数据的时间复杂度和空间复杂度。
|
| 关 键 词： | 查找 算法 时间复杂度 空间复杂度 |
The Compares of Some Searching Algorithms |
| |
| Institution: | (Nanchang Hangkong University ,College of Mathematics and Information Science, Nanchang Jiangxi ,330063) |
| |
| Abstract: | Searching is a commonly basic operation that can find a specific element of information in a number of information in computer applications. In this paper, four types of searching algorithm are introduced. They are sequential search, binary search tree, and hash search. The program＇s codes based on java are complied. The time complexity and space complexity to look for the same data are compared. |
| |
| Keywords: | Searching Mgorithm Time complexity Space complexity |
| 本文献已被 维普 等数据库收录！ |
