内排序算法C语言数据结构.doc

/*数据结构C语言内排序部分算法实现*/#include#includevoid Merge(int *R,int low,int m,int high)/*归并排序*/ int i=low,j=m+1,p=0; int *R1; R1=(int *)malloc(high-low+1)*sizeof(int); if(!R1) return; while(i=m&j=high) R1p+=(Ri=Rj)?Ri+:Rj+; while(i=m) R1p+=Ri+; while(j=high) R1p+=Rj+; for(p=0,i=low;i=high;p+,i+) Ri=R1p;void MergeSort(int R,int low,int high) int mid; if(lowhigh) mid=(low+high)/2; MergeSort(R,low,mid); MergeSort(R,mid+1,high); Merge(R,low,mid,high); void bubble(int *a,int n) /*冒泡排序，定义两个参数：数组首地址与数组大小*/int i,j,temp;for(i=0;in-1;i+)for(j=i+1;jaj)temp=ai;ai=aj;aj=temp;void choise(int *a,int n)/*选择排序*/int i,j,k,temp;for(i=0;in-1;i+)k=i; /*给记号赋值*/for(j=i+1;jaj) k=j; /*是k总是指向最小元素*/if(i!=k)/*当k!=i是才交换，否则ai即为最小*/temp=ai;ai=ak;ak=temp;void insert(int *a,int n)/*插入排序*/int i,j,temp;for(i=1;i=0&temp=1)for(i=k;i=0&xaj) aj+k=aj;j-=k;aj+k=x;k/=2; /*缩小间距值*/void quick(int *a,int i,int j)/*快速排序*/*数组首地址*a,要排序数组起始元素下标i,要排序数组结束元素下标j*/int m,n,temp;int k;m=i;n=j;k=a(i+j)/2; /*选取的参照*/dowhile(amk&mk&ni) n-; /* 从右到左找比k小的元素*/if(m=n) /*若找到且满足条件，则交换*/temp=am;am=an;an=temp;m+;n-;while(m=n);if(mi) quick(a,i,n);void base(int *a,int n,int maxnumber)/*借口分别是数组首地址和数组中的最大元素*/int xmaxnumber+2;int i;for(i=0;imaxnumber+1;i+)xi=0;/*数组初始化*/for(i=0;in;i+)x*(a+i)=*(a+i);for(i=0;imaxnumber+1;i+)if(xi=0);elseprintf(%5d,xi);printf(n);void print(int *a,int n)/*打印函数*/int i;for(i=0;in;i+)printf(%5d,ai);printf(n);void initial()int i;for(i=0;i16;i+)printf(-);printf(n数据结构-内排序n);for(i=0;i16;i+)printf(-);printf(n);int main() /*给每个函数定义一个相同数组*/int i;initial();int a1=98,2,16,83,35,47,18,70;int a2=98,2,16,83,35,47,18,70;int a3=98,2,16,83,35,47,18,70;int a4=98,2,16,83,35,47,18,70;int a5=98,2,16,83,35,47,18,70;int a6=98,2,16,83,35,47,18,70;printf(原始数据：);print(a1,8);printf(冒泡排序：);bubble(a1,8);print(a1,8);printf(选择排序：);choise(a2,8);print(a2,8);printf(快速排序：);quick(a3,0,7);print(a3,8);printf(插入排序：);insert(a4,8);print(a4,8);printf(希尔排序：);shell(a5,8);print(a5,8);printf(基数排序：);b