下面是幾種排序方法的程序:交換排序#include<stdio.h>#include<stdlib.h>mtmaiii(void){inta[10]={1,4,3,07,5,2,8,9,6};inti=0J=0;inttemp=0;for(i=0;i<9;i++){for(j=i+l;j<10;j++){if(a[i]>a[j]){temp=a[i];a[i]=a[j]；a[j]=temp;}}}for(i=0;i<10;i++){pnmf(”％d\f；a[i]);if((i+l)%5=0)pimtf(n\irr);}return0;}插入排序#include<stdio.h>#include<stdlib.h>mtmaiii(void){inta[9]={5,8,3,9,2,0,4,7,10};inttemp=0,i=0,j=0.z=0;for(i=0;i<9;i++)for(j=i+l;j<9;j++){if(a[j]<a[i]){temp=a|j];for(z=j-l;z>=i;z-){a[z+l]=a[z];}a[i]=temp;}}}for(i=0;i<9;i++){printf(”％d\f；a[i]);if((i+l)%5=0)pimtf(n\irr);}pnntf(M\nM);return0;}歸并#include<stdio.h>^include<stdlib.h>iiitmerge(mtiiitbegin,intend){int*c=NULL;inti=0;intx=0,y=0;intmid=0;nud=(begin-rend)/2;x=begin;y=mid+l;c=(int*)malloc((end+1)*4);if(c=NULL)return0:fbr(i=begin;i<(end+l);i++)if(x!=(niid+1)&&y!=(end+1))if(a[x]<a[v]){C[1]=a[x];x++;}else{c[i]=a[y];葉}}elseif(x!=(mid+1)){c[i]=a[x];x++;}else{c[i]=a[yl;y++;}}fbr(i=begin;i<end+l;i++){a[i]=c[i];}free(c);return0;}hitsoit(iiit*a,mtbegin,intend){if(begin>=end)retuni0;intmid=0;nud=(begin-rend)/2;sort(a,begin,nud);sort(a,nud+1,end);}}}}meige(a,begin,end);retuin0;}mtmam(void){inti=0;inta[10]={1,5,2,7,4,9,10,3,0,6}；sort(a.0,9);for(i=0;i<10;i++){pnmfT%d\f；a[i]);if((i+l)%5=0)}retuin0;}冒泡排序#include<stdio.h>#include<stdlib.h>#definesize9iiitmam(void){inta[size]={3,2,6,5,4,9,8,0,7};inti=OJ=0,flag=0,temp=0;fbr(i=0;i<size;i++){for(j=0;j<(size-i-l);j-H-){if(a|j]>a[j+l]){temp=a|j];a[j]=a[j+l];a[j+l]=temp;flag卄；if(flag==0)

break;flag=0;}for(i=0;i<9;i++){pnmfT%d\f/[i]);%5—0)pnnrff\n”)；}pnntfC，\nM);return0;}選擇排序#include<stdio.h>^include<stdlib.h>hitmam(void){mta[10]={0,2,5,3,7,1,9,10,6,4}；inttemp=0,flag=0;int1=OJ=0;for(i=0;i<9;i++){temp=a[i];flag=i；for(j=i+l;j<10;j++){if(temp>a|j]){temp=a[j]；flag=j；}}a[flag]=a[i];