严蔚敏 数据结构第十章 内部排序的具体代码(c++,附测试数据)(2)

cout << L.r[i].key<<" ";
}
cout<<endl <<endl;
//*********************************
SortData V[10]={5, 4, 0, 3, 7, 9, 2, 1, 8, 6};
cout<<"希尔排序之前的数组：";
for(i=0; i<10; i++){
cout<<V[i]<<" ";
}
ShellSort(V,10);
cout<<endl<<"希尔排序之后的数组：";
for(i=0; i<10; i++){
cout<<V[i]<<" ";
}
cout<<endl<<endl;
//***************************************************
for(i=0; i<10; i++){
cin>>V[i];
}
cout<<"冒泡排序之前的数组：";
for(i=0; i<10; i++){
cout<<V[i]<<" ";
}
BubbleSort(V,10);
cout<<endl<<"冒泡排序之后的数组：";
for(i=0; i<10; i++){
cout<<V[i]<<"
; ";
}
cout<<endl<<endl;
//*****************************************
for(i =1; i<=L.length; i++){
cin>>L.r[i].ke

这是可以直接编译并运行的cpp文件,供您下载之后,慢慢揣摩。

y;
}
QuickSort(L);
cout<<"快速排序后：";
for(i =1; i<=L.length; i++){
cout << L.r[i].key<<" ";
}
cout<<endl <<endl;
//***************************************************
for(i=0; i<10; i++){
cin>>V[i];
}
cout<<"直接选择排序之前的数组：";
for(i=0; i<10; i++){
cout<<V[i]<<" ";
}
SelectSort(V,10);
cout<<endl<<"直接选择排序之后的数组：";
for(i=0; i<10; i++){
cout<<V[i]<<" ";
}
cout<<endl<<endl;
//***********************************************************
HeapType H;
cin>>H.length;
for(i=1; i<=H.length; i++){
cin>>H.r[i].key;
}
HeapSort(H);
cout<<endl<<"堆排序之后的数组：";
for(i=1; i<=H.length; i++){
cout<<H.r[i].key<<" ";
}
cout<<endl<<endl;
//***************************************************************
for(i=0; i<10; i++){
cin>>V[i];
}
cout<<"归并排序之前的数组：";
for(i=0; i<10; i++){
cout<<V[i]<<" ";
}
MergeSort(V,10);
cout<<endl<<"归并排序之后的数组：";
for(i=0; i<10; i++){
cout<<V[i]<<" ";
}
cout<<endl<<endl;
//********************************************
cout<<"以下为
折半查找的递归实现"<<endl;
int kk;
cin>>kk;
cout<<BinCheck(V,kk,0,9)<<endl;

system("pause");
return 0;
}