排序与查找方法
#include#include
#define N 11
/*用**哨查找*/
int search(int array[],int n,int k)
{int i;
i=n-1;
array=k;
while(array!=k) i--;
return(i);
}
/*折半查找法*/
int halfsearch(int array[],int n,int k)
{int i,j,mid;
i=1;j=n;
while(i<=j)
{mid=(i+j)/2;
if(k==array) return(mid);
else if(k
else i=mid+1;
}
return(0);
}
/*冒泡排序法*/
void mpsort(int array[])
{int i,j,a;
a=0;
for(i=1;i
for(j=i+1;j
if(array>array)
{a=array;
array=array;
array=a;}
}
/*直接插入排序*/
void insertsort(int array[])
{int i,j;
for(i=2;i
{array=array;
j=i-1;
while(array
{array=array;
array=array;
}
}
}
/*建立*/
void creat(int array[])
{int i;
printf("enter the array:\n");
for(i=1;i
scanf("%d",&array);
}
/*显示*/
void print(int array[])
{int i;
printf("The numbers after sort is:\n");
for(i=1;i
printf("%d ",array);
printf("\n");
}
main()
{int a,i,x,chang;
/*printf("enter the array\n");
for(i=1;i<11;i++)
scanf("%d",&a);*/
aga:
printf("\nchang:1: use watching method finding\n 2:use half method finding\n 3: use directness intsert method sort\n 4:use bubble up method sort\n 5:exit\n");
scanf("%d",&chang);
switch (chang)
{case 1:
{creat(a);
printf("Please int the search number:\n");
scanf("%d",&x);
printf("The number station is:%d\n",search(a,N,x));
goto aga;
}
case 2:
{ creat(a);
insertsort(a);
print(a);
printf("Please int the search number:\n");
scanf("%d",&x);
printf("The number station is:%d\n",halfsearch(a,N,x));
goto aga;
}
case 3:
{creat(a);
insertsort(a);
print(a);
goto aga;
}
case 4:
{creat(a);
mpsort(a);
print(a);
goto aga;
}
case 5:{ printf("exit!\n");break;}
default:{printf("Error!\n"); goto aga;}
}
}
厉害！！！！！！！！！！！ 数据结构学得不错！
页:
[1]