学年论文题目：几种查找算法的比较与总结学院：计算机科学与工程专业：计算机科学与技术班级:12级计师1班学生姓名：马有华学号：201271030132指导教师：曹素珍PAGE\*MERGEFORMATIPAGE\*MERGEFORMAT26摘要查找是在大量的信息中寻找一个特定的信息元素，在计算机应用中,查找是常用的基本运算。文中介绍四种查找算法．分别是顺序查找、二分查找、二叉排序树查找和哈希查找。并用JAVA语言编写了相应程序代码，比较了查找同一个数据的时间复杂度和空间复杂度。关键词:查找算法；时间复杂度；空间复杂度AbstractSearchingisacommonlybasicoperationthatcanfindanumberofinformationincomputerapplications.Inthispaper,fourtapyesofsearchingalgorithmareintroduced.Theyaresquentialearch,binarysearchtree,andbashsearch.Theprogarm’scodesbasedonjavaarecomplied.Thetimecomplexityandspacecomplexitytolookforthesamedataandcompared.Keywords:SearchingAlgorithm；Timecomplexity；Spacecomplexity目录TOC\o"1-3"\h\z\uHYPERLINK\l"_Toc422752428"摘要PAGEREF_Toc422752428\h1HYPERLINK\l"_Toc422752429"1算法概述PAGEREF_Toc422752429\h1HYPERLINK\l"_Toc422752430"1.1引言PAGEREF_Toc422752430\h1HYPERLINK\l"_Toc422752431"1.2顺序查找PAGEREF_Toc422752431\h2HYPERLINK\l"_Toc422752432"1.3二分查找PAGEREF_Toc422752432\h2HYPERLINK\l"_Toc422752433"1.3.1二分查找要求PAGEREF_Toc422752433\h2HYPERLINK\l"_Toc422752434"1.3.2优缺点PAGEREF_Toc422752434\h2HYPERLINK\l"_Toc422752435"1.3.3算法思想PAGEREF_Toc422752435\h2HYPERLINK\l"_Toc422752436"1.3.4算法复杂度PAGEREF_Toc422752436\h3HYPERLINK\l"_Toc422752437"1.4分块查找PAGEREF_Toc422752437\h3HYPERLINK\l"_Toc422752438"1.4.1方法描述PAGEREF_Toc422752438\h3HYPERLINK\l"_Toc422752439"1.4.2操作步骤PAGEREF_Toc422752439\h3HYPERLINK\l"_Toc422752440"1.5哈希表查找PAGEREF_Toc422752440\h4HYPERLINK\l"_Toc422752441"1.5.1基本原理PAGEREF_Toc422752441\h4HYPERLINK\l"_Toc422752442"1.5.2函数构造PAGEREF_Toc422752442\h4HYPERLINK\l"_Toc422752443"1.5.3冲突处理PAGEREF_Toc422752443\h4HYPERLINK\l"_Toc422752444"1.5.4支持运算PAGEREF_Toc422752444\h4HYPERLINK\l"_Toc422752445"2算法实现PAGEREF_Toc422752445\h7HYPERLINK\l"_Toc422752446"2.1顺序查找PAGEREF_Toc422752446\h7HYPERLINK\l"_Toc422752447"2.1.1方法分类PAG