插入排序希尔排序快速排序冒泡排序c算法.doc

文档介绍：一、主界面
void main()
{
const int numv=12;
int [3][numv]={{0,6,13,19,23,37,39,41,45,48,58,86},{0,86,58,48,45,41,39,37,23,19,13,6},{0,23,13,48,86,19,6,41,58,37,45,39}};
int z1[numv],z2[numv];
int m,n,i,j,k;
printf("\t\t*******************************************\n");
printf("\t\t\t\t 排序\n");
printf("\t\t*******************************************\n");
printf("\t\t\t请选择测试数据类型:1正序\n" );
printf("\t\t\t请选择测试数据类型:2逆序\n" );
printf("\t\t\t请选择测试数据类型:3随机\n" );
printf("\t\t\t返回,请按4\n" );
printf("\t\t*******************************************\n");
scanf("%d",&m);
while(m>0 && m<4)
{
system("cls");
printf("\t\t*******************************************\n");
printf("\t\t\t\t 排序方法选择\n");
printf("\t\t*******************************************\n");
printf("\t\t\t请选择排序算法:1直接插入排序\n");
printf("\t\t\t请选择排序算法:2希尔排序\n");
printf("\t\t\t请选择排序算法:3冒泡排序\n");
printf("\t\t\t请选择排序算法:4快速排序\n");
printf("\t\t\t请选择排序算法:5简单选择排序\n");
scanf("%d",&n);
switch(n)
{
case 1:
printf( "直接插入排序前:\n");
for( j=1;j<numv;j++) printf("%d ",a[m-1][j]);
printf( "\n直接插入排序结果为:\n");
BiInsertsort(a[m-1],numv-1);
break;
case 2:
printf( "\n希尔排序前:\n");
for( j=1;j<numv;j++) printf("%d ",a[m-1][j]);
printf( "\n希尔排序结果为:\n");
ShellSort(a[m-1], numv-1);
break;
case 3:
printf( "\n冒泡排序前:\n");
for( k=1;k<numv;k++) printf("%d ",a[m-1][k]);
printf( "\n冒泡排序结果为