多種查找算法動(dòng)態(tài)演示軟件設(shè)計(jì)

1.59萬(wàn)字
自己原創(chuàng)的畢業(yè)論文，已經(jīng)通過(guò)校內(nèi)系統(tǒng)檢測(cè)，重復(fù)率低，僅在本站獨(dú)家出售，大家放心下載使用

摘要 算法的學(xué)習(xí)，對(duì)其執(zhí)行過(guò)程的理解是難點(diǎn)和重點(diǎn)，而在課堂上，老師不可能把所有算法的執(zhí)行過(guò)程都詳述開來(lái)，這樣，一些理解力比較差的學(xué)生在學(xué)習(xí)算法時(shí)就會(huì)遇到很大的困難。查找算法是數(shù)據(jù)結(jié)構(gòu)最重要的一種算法類型，其中包括很多晦澀難懂的查找算法，比如哈希查找。要學(xué)好各種算法，推演算法的執(zhí)行無(wú)疑是最好的方法。
本文介紹了一個(gè)折半查找、哈希查找和二叉排序樹查找三種查找算法動(dòng)態(tài)演示程序的設(shè)計(jì)及實(shí)現(xiàn)過(guò)程。此系統(tǒng)是用c#語(yǔ)言并利用visual studio 2012開發(fā)工具開發(fā)的。隨機(jī)或者手動(dòng)錄入數(shù)據(jù)后，數(shù)據(jù)會(huì)顯示在主界面中。這時(shí)可以選擇三種查找算法中的一種進(jìn)行演示。另外，本系統(tǒng)還提供了演示前必須做的一些準(zhǔn)備工作，比如對(duì)初始序列進(jìn)行排序，生成哈希表和二叉排序樹，并且哈希表和二叉排序樹的生成過(guò)程也是動(dòng)態(tài)的，可以像演示查找一樣查看它們。最后，本系統(tǒng)還提供了重復(fù)演示的機(jī)制，既能重復(fù)演示一個(gè)算法的查找工程，還能演示用不同的算法對(duì)相同的序列進(jìn)行查找，并且顯示出不同算法的查找次數(shù)，以形成鮮明的對(duì)比。
本系統(tǒng)簡(jiǎn)單易用，演示算法形象生動(dòng)，是學(xué)生自學(xué)，教師授課不可多得的有力工具
關(guān)鍵詞：查找算法，折半查找，哈希查找，二叉排序樹查找，動(dòng)態(tài)演示


The Design and Development of Several Search
Algorithm Dynamic Demo Software
Abstract Algorithms for learning, understanding its implementation process is difficult and focus, and in the classroom, the teacher is impossible to process all the algorithms are executed detailed open, so that some of the relatively poor understanding of the students in the learning algorithm will encountered great difficulties. Search algorithm is the most important type of data structure algorithms types, including many obscure search algorithms, such as hash lookup. To learn a variety of algorithms to push the implementation of the algorithm is the best approach.
    This article describes a binary search, hash lookup and find three kinds of binary sort tree search algorithm dynamically demo program design and implementation process. This system is used c # language and using visual studio 2012 development tools development. After random or manual data entry, the data will be displayed in the main interface. Then you can select one of three search algorithm in a presentation. In addition, the system also provides a must do some preparatory work before the presentation, such as sort of the initial sequence to generate a hash table and binary sort tree and hash table generation process and the binary sort tree is also dynamic and can Find view them as the same presentation. Finally, this system also provides a mechanism to repeat the demonstration, both to find an algorithm to repeat the demonstration projects, but also demonstrates the same sequence search by different algorithms, and shows the number of different algorithms to find, in stark contrast to .
    The system is simple to use, vivid demonstration of the algorithm is self-learning, teachers teaching a rare powerful tool

Keywords search algorithm, binsearch, hash lookup,binary sort tree lookup,dynamic demo

目 錄
The Design and Development of Several Search i
多種查找算法動(dòng)態(tài)演示軟件的設(shè)計(jì)與開發(fā) 2
第一章 緒論 6
1.1 課題研究的背景與意義 6
1.2 系統(tǒng)開發(fā)工具與語(yǔ)言 6
1.3 系統(tǒng)開發(fā)的目標(biāo) 7
第二章　算法介紹 8
2.1 折半查找算法 8
2.2 哈希查找算法 10
2.3 二叉排序樹查找算法 12
第三章　系統(tǒng)框架結(jié)構(gòu) 14
3.1 系統(tǒng)框架 14
3.2 功能描述 15
第四章 詳細(xì)設(shè)計(jì) 16
4.1 主界面設(shè)計(jì) 16
4.2 數(shù)據(jù)錄入 16
4.2.1 隨機(jī)生成 17
4.2.2 手動(dòng)錄入 17
4.2.3 數(shù)據(jù)顯示 19
4.3 算法選擇 19
4.4 算法執(zhí)行準(zhǔn)備 20
4.5 演示運(yùn)行 25
4.5.1 折半查找 26
4.5.2 哈希查找 29
4.5.3 二叉排序樹查找 32
4.5.4 暫停\繼續(xù) 35
4.5.5 代碼查看 35
4.7 復(fù)位 37
4.7.1 重查數(shù)字 37
4.7.2 重選算法 38
第五章　總結(jié)與展望 40
致 謝 41
參 考 文 獻(xiàn) 42