排序与查找方法

厚积薄发

#include
#include
7 E( s2 l' A# X) ]4 X$ _#define N 11
! i% p' Y: H% I" j( X/ J8 V/*用**哨查找*/
int search(int array[],int n,int k)
{int i;
i=n-1;
9 f; B  h  a0 p0 v* @  Karray[0]=k;
+ e/ V* |; B, f( c6 Gwhile(array[i]!=k) i--;
# n4 ^, }+ }- r/ v. B2 @4 ^$ Vreturn(i);
}
/*折半查找法*/
int halfsearch(int array[],int n,int k)
* g/ |. g: A; s8 g7 {1 |$ T$ v{int i,j,mid;
! W5 O% J) d; v' s' x2 x: ]6 Li=1;j=n;
while(i<=j)
/ V6 L6 t( i# ^+ ]' @! M{mid=(i+j)/2;
* Q# S8 G6 {+ s: hif(k==array[mid]) return(mid);
else if(k
else i=mid+1;
, \* S) u* c6 m. ?* X' N}
return(0);
}
5 v) ~) p  p. z7 c' D6 I/ t$ Y8 m/ A2 K/*冒泡排序法*/
2 `+ ?4 f1 J, f) I8 Xvoid mpsort(int array[])
2 B, S, a7 [7 t' T) N$ Y& s7 o$ A* h% D{int i,j,a;
7 J, A* o0 e4 i$ x5 Ca=0;
6 n/ k: V" |0 z. ^1 U5 \for(i=1;i
for(j=i+1;j
if(array[i]>array[j])
9 ?! n; B  J1 ?) L( t{a=array[i];
array[i]=array[j];
# z/ b0 B; q! I7 |array[j]=a;}
}
% P3 D* h" u! p) m9 [* f" R. V/*直接插入排序*/
void insertsort(int array[])
{int i,j;
4 a) H2 t' V7 u% V. Efor(i=2;i
{array[0]=array[i];
: A5 V: l( P. l3 k- cj=i-1;
* z2 r( l$ q. S5 c9 `0 Lwhile(array[0]
{array[j+1]=array[j--];
array[j+1]=array[0];
) q9 o2 _7 t/ ^! h# `6 Z) `# J}
; o  j$ G1 @5 C$ x}
5 T! x. t" F$ F" _}
$ Z' L  a- d9 I" @7 I' {& ~/*建立*/
4 p5 L' O& d( ^/ Z- a' v$ a  Wvoid creat(int array[])
: K! x. r  _3 k, }{int i;
3 F4 r. C/ _. F. d2 w5 Fprintf("enter the array:\n");
for(i=1;i
: e; G% W% D# yscanf("%d",&array[i]);
}
/*显示*/
void print(int array[])
{int i;
- f/ u* n1 d+ {- D9 H+ `  ]printf("The numbers after sort is:\n");
1 F" j6 u/ K1 Y" N! ?for(i=1;i
) V1 o7 r/ \8 [# m9 R6 Fprintf("%d ",array[i]);
6 t1 f! c  {8 j5 t8 Hprintf("\n");
1 x6 T" t% a* Y, z) Z}
main()
- o& H' N9 q/ w{int a[11],i,x,chang;
4 p- C8 {- @5 }/*printf("enter the array\n");
for(i=1;i<11;i++)
scanf("%d",&a[i]);*/
% l3 |5 m5 P$ x& yaga:
/ \, \  c9 r* {1 Qprintf("\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");
3 o! D& [7 C6 c3 w* gscanf("%d",&chang);
switch (chang)
' ^' `; V9 l4 @* x7 Y3 a, X5 J' `/ ^{case 1:
7 t3 S6 {" e( {) }9 N{creat(a);
printf("Please int the search number:\n");
* s3 X! b% B6 lscanf("%d",&x);
printf("The number station is:%d\n",search(a,N,x));
) P) M3 k% _& d4 Zgoto aga;
}
( @" W' M9 X& h/ B) O7 I! I; G) Wcase 2:
' L# p6 _5 e% ]) y{ creat(a);
insertsort(a);
) n6 d( t# j$ @7 pprint(a);
printf("Please int the search number:\n");
) n5 D. r( X2 f- y5 y) z- I% L9 z/ |+ Q. cscanf("%d",&x);
' F- i+ c. ~0 L/ e' K6 uprintf("The number station is:%d\n",halfsearch(a,N,x));
goto aga;
}
case 3:
{creat(a);
insertsort(a);
print(a);
goto aga;
$ {6 A( B1 F' a}
2 p) s; @5 Q4 g$ Z$ y9 x1 `case 4:
{creat(a);
mpsort(a);
print(a);
goto aga;
( y! H! A6 s3 w$ Z. ^4 N1 ^}
case 5:{ printf("exit!\n");break;}
default:{printf("Error!\n"); goto aga;}
}
& h  |2 ?; M0 R; N! ?! y9 ?}
1 X6 n, F" g7 ^( }1 a

gl1990119

厉害！！！！！！！！！！！

xushu

数据结构学得不错！