計算機軟件基礎幾種排序算法

958958464589645896454589645694569845689已知結點序列為{958456891voidChoose(int*A,intn)voidChoose(int*A,intn)//選擇排{int{for(intif(A[j]<A[k]){}}}順 選擇排序的算法復雜考慮n很大時，最多比較次=(n-1)+…+2+=(n-1)*n/2≈n2/2≈所以，算法復雜度為O(n2)

#include<stdio.h>#include<stdlib.h>#defineM1000voidinsert(short*a,short{......}/*略{shorta[M],n,scanf("%hd",&n);if(n>M-1||n< /*for(j=0;j<n;scanf("%hd",&a[j]);Choose(a,n); /*排序*/for(j=0;j<n; /*打印printf("%hd\n",}2⊙已知結點序列為{85949648598696485986459865498654 的冒泡排序函voidBubble(short*a,short{shortfor(inti=0;i<n-for(intj=0;j<n-{/*交換（冒泡）9696485{}}}

#include<stdio.h>#include<stdlib.h>#defineM1000voidinsert(short*a,short{......}/*略{shorta[M],n,scanf("%hd",&n);if(n>M-1||n< /*結點數(shù)超界for(j=0;j<n;scanf("%hd",順 冒泡排序的算法復雜考慮n很大時，最多比較次=(n-1)+…+2+=(n-1)*n/2≈n2/2≈所以，算法復雜度為O(n2)

Bubble(a /*排序for(j=0;j<n;j++) /*打印*/printf("%hd\n",a[j]);}4⊙⊙已知結點序列為{659481, 的快速排序函voidQuick_Sort(int*a,intlow,inthigh)//low和high是數(shù)組的下{66{

Low=0; 61 61159486{while(a[l]<t)while(a[h]>t)h-- { 68689 4}}

6 #include<stdio.h>#include<stdlib.h>t t

voidQuick_Sort(int*a,intlow,intttt/*略*/ttt{shorta[M],n,scanf("%hd",&n);if(n>M-1||n< /*for(j=0;j<n;scanf("%hd",&a[j]);Quick_Sort(a,0，n-1);/*排序*/for(j=0;j<n;j++) /*打印*/printf("%hd\n",}

情況：需要分n7123456所以復雜度是O(n2)7⊙Combine:將兩個排序12234567122345677,1,3,2,

524524766254254768 的合并排序函voidmerge(short*a,intl,intm,int{intn1=m-l+intn2=r-shortleft[n1],2457123624571236for(i=0;i<n1;i++)/*leftholdsa[l..m]*/left[i]=a[l+i];for(j=0;j<n2;j++)/*rightholdsa[m+1..r]right[j]=2457i=j2457k=while(i<n1&&j<if(left[i]<245712324571236a[k++]=while(i<n1)/*left[]isnotexhausteda[k++]=while(j<n2)/*right[]isnotexhausteda[k++]=}

24571236 245712361236 k952475247voidMerge_Sort(short*a,intl,int{6int6if(l<r)m=(l+r)/6Merge_Sort(l,6Merge_Sort(m+1,7425merge(a,l,7425}}25472547{shorta[M],n,scanf("%hd",&n);if(n>M-1||n< /*for(j=0;j<n;j++)scanf("%