数据结构课程设计十种排序算法比较

int a1[N],i; int e=N;

sqlist a,b,c,d,num,R,nu,a2,b2; int c1[N];

int low=0,high=10; int dat[N];

init(a1);//随机产生个数 for(i=0;i

c1[i]=a1[i]; a[i].key=a1[i]; b[i].key=a1[i]; c[i].key=a1[i]; d[i].key=a1[i]; num[i].key=a1[i]; R[i].key=a1[i]; nu[i].key=a1[i]; dat[i]=a1[i]; }

cout<<\排序前数组:\\n\for(i=0;i

cout<

cout<<\起泡排序运行结果:\\n\gensort(a1,sizeof(a1)/sizeof(int)); cout<<\插入排序运行结果:\\n\insertsort(a,N);

cout<<\希尔排序运行结果:\\n\shellsort(b,N);

cout<<\选择排序运行结果:\\n\gentsort(c1,N);

cout<<\快速排序运行结果:\\n\sort(c,low,high);

cout<<\堆排序运行结果:\\n\sorting(d,N);

cout<<\折半插入排序运行结果:\\n\so(num,N);

cout<<\二路插入排序运行结果:\\n\sort3( nu, N);

cout<<\二路归并的排序结果\\n\MergeSort(a2,N);

cout<<\基数排序的排序结果\\n\ }