Download presentation
Presentation is loading. Please wait.
1
程式設計--Quick Sort 通訊一甲 B 楊穎穆
2
目錄 1.目的 2.排序原理 3.程式 4.實驗結果顯示 5.參考資料
3
目的 1. 試輸入n個未排序的整數到陣列中 2. 嘗試把未排序的整數到陣列中之數值依照陣列位置與值印出
3. 嘗試用快速排序(Quick Sort)法把陣列中之數值由小而大地排序 4. 嘗試把排序後的整數到陣列中之數值依照陣列位置與值印出
4
排序原理 A[0] A[1] A[2] A[3] A[4] 2 8 7 1 3 2 1 3 8 7
![排序原理 A[0] A[1] A[2] A[3] A[4]](http://slidesplayer.com/slide/16966410/97/images/4/%E6%8E%92%E5%BA%8F%E5%8E%9F%E7%90%86+A%5B0%5D+A%5B1%5D+A%5B2%5D+A%5B3%5D+A%5B4%5D.jpg "排序原理 A[0] A[1] A[2] A[3] A[4]")
5
程式 #include <stdio.h> #include <stdlib.h> #define n 8
int Partition(int a[],int p, int r){ int j,temp; int x=a[r]; int i=p-1; for(j=p;j<r;j++){ if(a[j]<=x){ i++; if(i !=j){ temp=a[i]; a[i]=a[j]; a[j]=temp; }
6
temp=a[i+1]; a[i+1]=a[j]; a[j]=temp; printf("\n"); for(j=0;j<n;j++) printf(" %d",a[j]); return i+1; } int quicksort(int a[],int p,int r){ int q; if(p<r){ q=Partition(a,p,r); quicksort(a,p,q-1); quicksort(a,q+1,p);
![temp=a[i+1]; a[i+1]=a[j]; a[j]=temp; printf( \n ); for(j=0;j<n;j++) printf( %d ,a[j]); return i+1;](http://slidesplayer.com/slide/16966410/97/images/6/temp%3Da%5Bi%2B1%5D%3B+a%5Bi%2B1%5D%3Da%5Bj%5D%3B+a%5Bj%5D%3Dtemp%3B+printf%28+%5Cn+%29%3B+for%28j%3D0%3Bj%3Cn%3Bj%2B%2B%29+printf%28+%25d+%2Ca%5Bj%5D%29%3B+return+i%2B1%3B.jpg "} int quicksort(int a[],int p,int r){ int q; if(p<r){ q=Partition(a,p,r); quicksort(a,p,q-1); quicksort(a,q+1,p);")
7
int main(void){ int t,A[n]; for(t=0;t<n;t++){ printf(" 請輸入任意數字[%d]:",t); scanf("%d",& A[t]); } quicksort(A,0,n-1); printf("\n由小到大排序後的數字[%d]:",t); printf("%d \n",A[t]); system("PAUSE"); return 0;
![int main(void){ int t,A[n]; for(t=0;t<n;t++){ printf( 請輸入任意數字[%d]: ,t); scanf( %d ,& A[t]); } quicksort(A,0,n-1);](http://slidesplayer.com/slide/16966410/97/images/7/int+main%28void%29%7B+int+t%2CA%5Bn%5D%3B+for%28t%3D0%3Bt%3Cn%3Bt%2B%2B%29%7B+printf%28+%E8%AB%8B%E8%BC%B8%E5%85%A5%E4%BB%BB%E6%84%8F%E6%95%B8%E5%AD%97%5B%25d%5D%3A+%2Ct%29%3B+scanf%28+%25d+%2C%26+A%5Bt%5D%29%3B+%7D+quicksort%28A%2C0%2Cn-1%29%3B.jpg "printf( \n由小到大排序後的數字[%d]: ,t); printf( %d \n ,A[t]); system( PAUSE ); return 0;")
8
實驗結果顯示
9
參考資料 主要的參考資料來至”演算法概論”這本書及王志湖老師上課所教授的內容。
10
END
Similar presentations
