C语言排序题
C语言排序#include<stdio.h>#include<stdlib.h>#include<time.h>#define MaxSize10000typedef int KeyType;typedef char InfoType[MaxSize];typedef struct{KeyType key;}RecType;intswap1=0,swap2=0,swap3=0;intcount1=0,count2=0,count3=0;clock _tstart1,start2,start3,end1,end2,end3;void BubbleSort(RecTypeR[], int n){int i,j;RecType temp;start1=clock();for(i=0;i<n-1;i++){for(j=n-1;j>i;j--){if(R[j].key<R[j-1].key){temp=R[j];R[j]=R[j-1];R[j-1]=temp;swapl++;}count1++;}}endl=clock();void QuickSort(RecTypeR[], int s, int t)int i=s,j=t;RecType temp;start2=clock();if(s<t){temp=R[s];swap2++;while(i!=j){while(j>i&&R[j].key>temp.key){j--;count2++;}if(i<j){R[i]=R[j];i++;swap2++;}while(i<j&&R[i].key<temp.key){i++;}{count2++;}if(i<j){R[j]=R[i];j--;swap2++;}}R[i]=temp;swap2++;QuickSort(R,s,i-1);QuickSort(R,i+1,t);end2=clock();}}void SelectSort(RecTypeR[], int n){int i,j,k;RecType temp;start3=clock();for(i=0;i<n-1;i++){k=i;for(j=i+1;j<n;j++)if(R[j].key<R[k].key){k=j;count3++;}if(k!=i){temp=R[i];R[i]=R[k];R[k]=temp;swap3++;}}end3=clock();}void reserve(RecTypeR[],RecTypea[], int n){int i;for(i=0;i<n;i++)R[i].key=a[i].key;}void suì_ ji(){int i,n;RecTypeR[MaxSize];RecTypea[MaxSize];printf("请输入您要输