C语言学习知识所有内部排序算法.doc
!-C语言 所有内部排序算法 冒泡法，选择法，插入法，快排法，希尔，归并，. 1冒泡法：#include<stdio.h>#include<stdlib.h>void mao_pao(int *a,int n)int i,j,temp,flag;for(i=0;i<n-1&&flag;+i)flag=0;for(j=0;j<n-1;+j) if(aj>aj+1) flag=1; temp=aj; aj=aj+1; aj+1=temp; void main()int *a,i,n;a=(int *)malloc(100);if(NULL=a) printf("allocation failturen"); exit(1);printf("请输入你要排序的元素的个数n");scanf("%d",&n);printf("现在开始输入%d个元素n",n);for(i=0;i!=n;+i)scanf("%d",&ai);mao_pao(a,n);printf("排序后为：n");for(i=0;i!=n;+i)printf("%d ",ai);printf("n");free(a);2，选择排序法#include<stdio.h>#include<stdlib.h>void xuan_zhe(int *a,int n)int i,j,temp,max;for(i=0;i<n-1;+i)max=i;for(j=i+1;j<n;+j) if(aj<amax) max=j;if(i!=max)temp=ai;ai=amax;amax=temp;void main()int *a,i,n;a=(int *)malloc(100);if(NULL=a) printf("allocation failturen"); exit(1);printf("请输入你要排序的元素的个数n");scanf("%d",&n);printf("现在开始输入%d个元素n",n);for(i=0;i!=n;+i)scanf("%d",&ai);xuan_zhe(a,n);printf("排序后为：n");for(i=0;i!=n;+i)printf("%d ",ai);printf("n");free(a);3，插入排序#include<stdio.h>#include<stdlib.h>void cha_ru(int *a,int n)int i,j,temp;for(i=0;i<n-1;+i)temp=ai+1;for(j=i;j>=0&&temp<aj;-j)aj+1=aj;a+j=temp;void main()int *a,i,n;a=(int *)malloc(100);if(NULL=a) printf("allocation failturen"); exit(1);printf("请输入你要排序的元素的个数n");scanf("%d",&n);printf("现在开始输入%d个元素n",n);for(i=0;i!=n;+i)scanf("%d",&ai);cha_ru(a,n);printf("排序后为：n");for(i=0;i!=n;+i)printf("%d ",ai);printf("n");free(a);4.快速排序#include<stdio.h>#include<stdlib.h>void kuai_pai(int *a,int low,int high)int left,right,middle,i,j,temp;left=low;right=high;middle=(left+right)/2;while(left<right)while(left<high&&aleft<amiddle) left+;while(right>low&&aright>amiddle) right-;if(left<=right)temp=aleft;aleft=aright;aright=temp;left+;right-;if(left<high) kuai_pai(a,left,high);if(right>low) kuai_pai(a,low,right);void main()int *a,i,n;a=(int *)malloc(100);if(NULL=a) printf("allocation failturen"); exit(1);printf("请输入你要排序的元素的个数n");scanf("%d",&n);printf("现在开始输入%d个元素n",n);for(i=0;i!=n;+i)scanf("%d",&ai);kuai_pai(a,0,n-1);printf("排序后为：n");for(i=0;i!=n;+i)printf("%d ",ai);printf("n");free(a);5.shell排序#include<stdio.h>#include<stdlib.h>void shell(int *a,int n)int gap,i,j,temp;for(gap=n/2;gap>0;gap=gap/2)for(i=gap;i<n;i+)for(j=i-gap;j>=0&&aj>aj+gap;j=j-gap)temp=aj;aj=aj+gap;aj+gap=temp;void main()int *a,i,n;a=(int *)malloc(100);if(NULL=a) printf("allocation failturen"); exit(1);printf("请输入你要排序的元素的个数n");scanf("%d",&n);printf("现在开始输入%d个元素n",n);for(i=0;i!=n;+i)scanf("%d",&ai);shell(a,n);printf("排序后为：n");for(i=0;i!=n;+i)printf("%d ",ai);printf("n");free(a);6.二路归并排序#include<stdio.h>#include<stdlib.h>void gui_bin(int *a,int *b,int k,int n)int l1,l2,i,j,u1,u2,l=0;l1=0;while(l1+k<n) l2=l1+k; u1=l2-1; u2=(l2+k-1<n)?l2+k-1:n-1; i=l1; j=l2; while(i<=u1&&j<=u2) if(ai<=aj) bl+=ai+; else bl+=aj+; while(i<=u1) bl+=ai+; while(j<=u2) bl+=aj+; l1=u2+1;for(i=l1;i<n;+i) bl+=ai;void main()int *a,*b,i,n,k=1;a=(int *)malloc(100);if(NULL=a) printf("allocation failturen"); exit(1);b=(int *)malloc(100);if(NULL=b) printf("allocation failturen"); exit(1);printf("请输入你要排序的元素的个数n");scanf("%d",&n);printf("现在开始输入%d个元素n",n);for(i=0;i!=n;+i)scanf("%d",&ai);while(k<n)gui_bin(a,b,k,n);for(i=0;i<n;+i) ai=bi;k=k*2;printf("排序后为：n");for(i=0;i!=n;+i)printf("%d ",ai);printf("n");free(a);free(b);7.堆排序思想是，跟节点都比他们的儿子节点都大，之后从第一个非叶子节点开始到最上的跟节点，依次求其的跟节点，最上的根节点就是值最大的点，这样取得最大值之后，继续求根节点，就能得到一个有序序列。这里要数以的是因为所有节点都在数组里保存，又因为数组的下标是从0开始的，因此跟节点i对应的叶子节点就是，2*I+1和2*I+2，而第一个非叶子节点是(n-2)/2.#include<stdio.h>#include<stdlib.h>void dui_paixue(int *a,int n,int m)int i,j,l,temp;i=m;j=2*i+1;temp=ai;while(j<n)if(j<n-1&&aj<aj+1) j+;if(aj<temp) break;elseai=aj;i=j;j=2*i+1;ai=temp;void dui(int *a,int n)int i;for(i=(n-2)/2;i>=0;i-)dui_paixue(a, n, i);void main()int *a,*b,i,j,temp,n,k=1;a=(int *)malloc(100);if(NULL=a) printf("allocation failturen"); exit(1);b=(int *)malloc(100);if(NULL=b) printf("allocation failturen"); exit(1);printf("请输入你要排序的元素的个数n");scanf("%d",&n);printf("现在开始输入%d个元素n",n);for(i=0;i!=n;+i)scanf("%d",&ai);dui(a,n);for(j=n-1;j>=0;-j) temp=a0; a0=aj; aj=temp; dui_paixue( a, j, 0);printf("排序后为：n");for(i=0;i!=n;+i)printf("%d ",ai);printf("n");free(a);free(b);8.基数排序（我写的这个基数排序可能效率有点低，也肯能有点小BUG，等着以后改进吧）#include<stdio.h>#include<stdlib.h>#define max 10void main()int p1010;int amax,i,j,m,n,k,count,flag=1,temp;for(i=0;i!=10;+i) for(j=0;j!=10;+j) pij=-999;printf("请输入你要输入的元素的个数n");scanf("%d",&n);printf("请输入%d个元素n",n);for(i=0;i!=n;+i)scanf("%d",&ai);for(i=0;i!=n;+i)count=0;k=ai;while(k>0)m=k%10;k=k/10;count+;while(pcountm!=-999)if(pcountm>ai)temp=pcountm;pcountm=ai;ai=temp;elsem+;pcountm=ai;for(i=0;i!=10;i+) for(j=0;j!=10;j+) if(pij!=-999) printf("%d ",pij);
