算法設(shè)計(jì)與分析試驗(yàn)報(bào)告---快速排序

1、河的3衰夬摩優(yōu)質(zhì)范文算法分析與設(shè)計(jì)實(shí)驗(yàn)報(bào)告題目快速排序姓名：于文靜班級(jí)：計(jì)科F1203學(xué)號(hào)：201216010230指導(dǎo)教師： 靳小波完成時(shí)間：2015-04-06實(shí)驗(yàn)題目用遞歸分治法編寫(xiě)Hoare快速排序算法二、實(shí)驗(yàn)?zāi)康?. 理解時(shí)間復(fù)雜度的概念。2. 深入地掌握C語(yǔ)言編程。3. 通過(guò)編程直觀地理解算法分析的意義三、實(shí)驗(yàn)要求請(qǐng)使用遞歸分治法編寫(xiě)Hoare快速排序算法，算法的輸入如下：7.30 7.154.272.146.293.990.269.101.892.860.445.524.354.39 6.709.823.552.389.123.541.305.206.599.081.793.52

2、4.06 0.435.317.196.077.069.927.793.466.161.832.783.202.95 9.200.227.138.285.580.802.637.443.048.589.614.522.12 1.734.163.662.364.089.368.034.924.909.599.837.853.99 2.682.494.697.677.568.853.887.746.275.487.292.813.67 2.521.951.824.384.425.544.411.940.318.415.694.59四、程序流程圖將要排序的數(shù)據(jù)讀入到文本文件中，再將文本文件中的內(nèi) 容寫(xiě)

3、到數(shù)組a中，其中，變量ent為數(shù)組a的長(zhǎng)度；對(duì)數(shù)組a進(jìn)行一次劃分，并定義變量i=low j=high,low和high分別為低地址和高地址；五、程序代碼#in cludeint Partiti on( double a,i nt low,i nt high)int i,j;double temp;i=low;j=high;while(ij)while(aiv=aj&ij)j-;if(ij)temp=ai;ai=aj;aj=temp;i+;while(ai=aj&ij)i+;if(ij)temp=ai;ai=aj;aj=temp;j-;return i;void quickSort(double

4、 a,i nt low,i nt high) int q；if(lowhigh)q=Partitio n(a,low,high);quickSort(a,low,q-1); quickSort(a,q+1,high);void mai n()FILE* file = NULL;int k,c nt;double a1000;if(file = fope n(i nput2.txt,r) = NULL) prin tf(the file does not exist. n); return; ent = 0;while(!feof(file)fsca nf(file,%lf,&ac nt);cn

5、t+;quickSort(a,0,c nt-1);for(k=0;kcnt;k+)prin tf(%.2f ,ak);六、實(shí)驗(yàn)結(jié)果乍:算蚣析與設(shè)計(jì)Wbug快速排序?qū)逾?.229.2&0.310.430.44Q.BD1.301.731.791.821.831.891.941.952.3G2.382.492.522.632.G82.782.8122.953,043*203.463.533 .B63.673.883.993.994.064.084.164.274.354_384.394.414.424.690勺925.205.315.5255斗5.5856.076.166.2?6.297.067.137.157.197.297.307-447.567.677.747_797.85S.038.2B9.859.089.109.129.20,369.599,619.829.S39*92Press；ke/2.12 2.143.54 3.554.52 4.596.59 6.?08.41 8.58 to continue七、實(shí)驗(yàn)體會(huì)通過(guò)本次實(shí)驗(yàn)，我了解到快速排序的基本思想，即通過(guò)一趟排序?qū)⒁判虻臄?shù)據(jù) 分割成獨(dú)立的兩部分，其中一部分的數(shù)據(jù)都小于等于某一個(gè)數(shù)， 另一部分的數(shù)據(jù) 都大于等于這個(gè)數(shù)，然后再用遞歸的思想分別對(duì)左右兩部分的數(shù)據(jù)進(jìn)行快速排 序，從而使得整個(gè)序列都變得有序。 像這