多種排序算法動態(tài)演示軟件的設(shè)計(jì)與開發(fā)

論文字?jǐn)?shù):8069,頁數(shù):25

摘  要
隨著計(jì)算機(jī)科學(xué)技術(shù)的不斷提高和發(fā)展，其強(qiáng)大的運(yùn)算功能已經(jīng)逐漸融入人類社會的各個領(lǐng)域，并且在各個領(lǐng)域中發(fā)揮越來越重要的作用。當(dāng)然，高效的運(yùn)算速度并不代表無限快，在有限的資源空間里，要大大提高運(yùn)算處理數(shù)據(jù)的速率，就需要我們使用那些在時間和空間上體現(xiàn)出高效的算法。本系統(tǒng)是為了演示在同一問題上，不同的算法在效率上存在的巨大差異。本系統(tǒng)采用Visual C++ 6.0中文版為開發(fā)工具，實(shí)現(xiàn)三種不同排序算法，即：冒泡排序算法、選擇排序算法和快速排序算法，以及這三種排序?qū)ν�一問題的處理并且以圖形的形式給出快慢比較，實(shí)現(xiàn)排序算法的動態(tài)演示。其目的是為了讓我們在使用計(jì)算機(jī)處理規(guī)模越來越大的數(shù)據(jù)問題上，能夠清楚什么樣的算法適合當(dāng)前的處理系統(tǒng)。

關(guān)鍵詞：Visual C++；排序算法；動態(tài)演示The Design and Development of Dynamic Sorting Algorithm Demo
 Abstract
With computer science and technology improvement and development, its powerful computing has gradually integrate into human society in various fields, and play an increasingly important role. Of course, efficient computational speed does not mean unlimited fast, and the limited resources of space, Operators must significantly improve processing speed, we need to use the time and space reflects efficient algorithms. The system is to demonstrate on the same issues in different algorithm efficiency in the enormous difference. The system uses Visual C ++6.0 for the development of the Chinese version of tools to achieve three different sorting algorithms, namely : The Bubble Sorting Algorithm, The Select Sorting Algorithm and The Quick Sorting Algorithm, and three ranking on the same issue to deal with and the graphics are presented in the form of speed, Sorting Algorithm to achieve the dynamic presentation. Its purpose is that enable us to use computers to handle the increasingly large scale data problems, to know what kind of algorithm is suitable for the current system.

Key words: Visual C ++ ;  Sorting Algorithm; Dynamic Demonstration

目錄

1 引言 1
1.1 系統(tǒng)背景 1
1.2 系統(tǒng)開發(fā)的意義 1
1.3 系統(tǒng)開發(fā)的相關(guān)技術(shù) 1
1.4 系統(tǒng)開發(fā)的相關(guān)概念 1
2 系統(tǒng)需求及分析 2
2.1 系統(tǒng)需求 2
2.2 系統(tǒng)開發(fā)環(huán)境選擇 2
2.3 系統(tǒng)的總體規(guī)劃 2
3 系統(tǒng)設(shè)計(jì)思想 2
3.1 冒泡算法及思想 2
3.2 選擇算法及思想 4
3.3 快速算法及思想 5
4 詳細(xì)設(shè)計(jì) 8
4.1 系統(tǒng)的文件的組織 8
4.2 動態(tài)演示冒泡算法模塊設(shè)計(jì) 8
4.3 動態(tài)演示選擇算法模塊設(shè)計(jì) 11
4.4 動態(tài)演示快速算法模塊設(shè)計(jì) 13
4.5 同時比較三種算法模塊設(shè)計(jì) 16
4.6 系統(tǒng)的測試 16
4.7 系統(tǒng)的特點(diǎn) 18
結(jié)    論 19
參考文獻(xiàn) 19
致    謝 20
聲    明 21