c语言几种排序方法程序

《c语言几种排序方法程序》由会员上传分享，免费在线阅读，更多相关内容在应用文档-天天文库。

1、下面是几种排序方法的程序：1.交换排序#include#includeintmain(void){inta[10]={1,4,3,0,7,5,2,8,9,6};inti=0,j=0;inttemp=0;for(i=0;i<9;i++){for(j=i+1;j<10;j++){if(a[i]>a[j]){temp=a[i];a[i]=a[j];a[j]=temp;}}}for(i=0;i<10;i++){printf("%dt",a[i]);if((i+1)%5==0)printf("");}//printf("");return0;}2.插入排

2、序#include#includeintmain(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+1;j<9;j++){if(a[j]=i;z--){a[z+1]=a[z];}a[i]=temp;}}}for(i=0;i<9;i++){printf("%dt",a[i]);if((i+1)%5==0)printf("");}printf("");return0;}2.归并#

3、include#includeintmerge(int*a,intbegin,intend){int*c=NULL;inti=0;intx=0,y=0;intmid=0;mid=(begin+end)/2;x=begin;y=mid+1;c=(int*)malloc((end+1)*4);if(c==NULL)return0;for(i=begin;i<(end+1);i++){if(x!=(mid+1)&&y!=(end+1)){if(a[x]

4、id+1)){c[i]=a[x];x++;}else{c[i]=a[y];y++;}}for(i=begin;i=end)return0;intmid=0;mid=(begin+end)/2;sort(a,begin,mid);sort(a,mid+1,end);merge(a,begin,end);return0;}intmain(void){inti=0;inta[10]={1,5,2,7,4,9,10,3,0,6};sort(a

5、,0,9);for(i=0;i<10;i++){printf("%dt",a[i]);if((i+1)%5==0)printf("");}return0;}2.冒泡排序#include#include#definesize9intmain(void){inta[size]={3,2,6,5,4,9,8,0,7};inti=0,j=0,flag=0,temp=0;for(i=0;ia[j+1]){temp=a[j];a[j]=a[j+1];a[j+1]=temp

6、;flag++;}}if(flag==0)break;flag=0;}for(i=0;i<9;i++){printf("%dt",a[i]);if((i+1)%5==0)printf("");}printf("");return0;}2.选择排序#include#includeintmain(void){inta[10]={0,2,5,3,7,1,9,10,6,4};inttemp=0,flag=0;inti=0,j=0;for(i=0;i<9;i++){temp=a[i];flag=i;for(j=i+1;j<10;j++){if(temp>

7、a[j]){temp=a[j];flag=j;}}a[flag]=a[i];a[i]=temp;}for(i=0;i<10;i++){printf("%dt",a[i]);if((i+1)%5==0){printf("");}}//printf("");return0;}