课程设计——内部排序算法比较(19)

数据结构课程设计

d[i].key=a1[i]; }

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

cout<<setw(4)<<a1[i]; cout<<endl;

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"; for(i=0;i<N;i++)

cout<<setw(4)<<a1[i]; cout<<endl; cin.get(); }

19