Question

c++程序代码，数据排序的课程设计，有详细注释！谢谢

尽量长一点，差不多有个100行左右吧！1、能进行各种排序算法运算，包括直接插入排序、希尔排序、冒泡排序、快速排序、直接选择排序和推排序，鼓励涉及其他排序算法。2、数据输入有手工输入和随机生成。随机个数小于10000.手工输入个数小于10.3、排序后显示排序结果。

Answer 1

#include<iostream>
#include<cstdlib>
using namespace std;
void select(int n);
void insert(int a[],int n);
void input1(int a[],int n);
void input2(int a[],int n);
void choose(int a[],int n);
void exchange(int a[],int n);
void merge(int a[],int left,int mid,int right);
void output(int a[],int n);
int main()
{
cout<<" 数据排序"<<endl;
cout<<" =============="<<endl;
cout<<endl;
cout<<" 1. 插入排序"<<endl;
cout<<" 2. 选择排序"<<endl;
cout<<" 3. 交换排序"<<endl;
cout<<" 4. 归并排序"<<endl;
cout<<endl;
cout<<" 请选择（1~4，0：退出）"<<endl;
int select,n,way;
int *a;
cin>>select;
switch(select)
{
case 1:cout<<"插入排序"<<endl;
cout<<"请确定输入数据个数：";
cin>>n;
a=new int [n];
cout<<"请选择输入方式："<<"1为手工输入，2为随机生成"<<endl;
cin>>way;
switch(way){
default : cout<<"输入错误！"<<endl;
case 1:input1(a,n);
insert(a,n);
output(a,n);
delete []a;
break;
case 2:input2(a,n);
insert(a,n);
output(a,n);
delete []a;
break;
}
break;
case 2:cout<<"选择排序"<<endl;
cout<<"请确定输入数据个数：";
cin>>n;
a=new int [n];
cout<<"请选择输入方式："<<"1为手工输入，2为随机生成"<<endl;
cin>>way;
switch(way)
{
default : cout<<"输入错误！"<<endl;
case 1:input1(a,n);
choose(a,n);
output(a,n);
delete []a;
break;
case 2:input2(a,n);
choose(a,n);
output(a,n);
delete []a;
break;
}
break;
case 3:cout<<"交换排序"<<endl;
cout<<"请确定输入数据个数：";
cin>>n;
a=new int [n];
cout<<"请选择输入方式："<<"1为手工输入，2为随机生成"<<endl;
cin>>way;
switch(way)
{
default : cout<<"输入错误！"<<endl;
case 1:input1(a,n);
exchange(a,n);
output(a,n);
delete []a;
break;
case 2:input2(a,n);
exchange(a,n);
output(a,n);
delete []a;
break;
}
break;
case 4:cout<<"归并排序"<<endl;
cout<<"请确定输入数据个数：";
cin>>n;
a=new int [n];
cout<<"请选择输入方式："<<"1为手工输入，2为随机生成"<<endl;
cin>>way;
switch(way)
{
default :cout<<"输入错误！"<<endl;
case 1:input1(a,n);
merge(a,0,n/2,n);
output(a,n);
delete []a;
break;
case 2:input2(a,n);
merge(a,0,n/2,n);
output(a,n);
delete []a;
break;
}
break;
case 0:
break;
}return 0;
}
void input1(int a[],int n){
for(int i=0;i<n;i++)
cin>>a[i];
}
void input2(int a[],int n){
for(int i=0;i<n;i++)
a[i]=rand()%100;
for(int j=0;j<n;j++)
cout<<a[j]<<" ";
cout<<endl;
}
void output(int a[],int n){
for(int i=0;i<n;i++){
int k=0;
k++;
cout<<a[i]<<" ";
if(k%10==0)
cout<<endl;
}
}
void insert(int a[],int n){
int k;
for(int i=0;i<n-1;i++)
{
k=a[i+1];
int j=i;
while(j>=0&&k<a[j]) //若相邻2数据顺序不对
{
a[j+1]=a[j];;
j--;
}
a[j+1]=k; //到这里实现将每个i取值时顺序不对的数据调换位置
}
}
void choose(int a[],int n){
int t,k;
for(int i=0;i<n-1;i++){
int j=i;
for(k=i+1;k<n;k++)
if(a[k]<a[j]) //顺序不对，将较小的数据下标传递给j
j=k;
if(j!=i)
{
int t=a[i]; //将这2数据顺序交换，实现正序排列
a[i]=a[j];
a[j]=t;
}
}
}
void exchange(int a[],int n){
int i,j;
for(i=0;i<n-1;i++)
for(j=i+1;j<n;j++)
if(a[i]>a[j]){
int t=a[i];
a[i]=a[j];
a[j]=t;
}

}void merge(int a[],int left,int mid,int right)
{
int *b=new int [right-left+1];
int i=left,j=mid+1,k=0;
while((i<=mid)&&(j<=right))
if(a[i]<=a[j]) b[k++]=a[i++];
else b[k++]=a[j++];
while (i<=mid) b[k++]=a[i++];
while(j<=right) b[k++]=a[j++];
for(i=0,k=left;k<=right;) a[k++]=b[i++];
}