排序与查找方法

厚积薄发

#include
0 U" D" F1 ]) G1 g7 W#include
2 a6 d4 |% Q3 j( M, ~% o1 X/ X* w! `& W#define N 11
8 |: z' N) O- Y/*用**哨查找*/
3 x8 \, M* c% d/ Mint search(int array[],int n,int k)
- x7 h$ Q$ n, r( J/ w) n0 R. C, \{int i;
" T# J( Y: s$ Fi=n-1;
% t8 i7 D" J. }2 r, i0 D" garray[0]=k;
  G1 T3 b) t% b1 \while(array[i]!=k) i--;
; ^0 P7 x. e+ G7 i+ f3 r" Z& Freturn(i);
7 f3 q! ]3 L! p  w& h! Y) {}
- \6 {) V; [2 q! c+ q/*折半查找法*/
2 N9 M, W/ |0 Q% \int halfsearch(int array[],int n,int k)
{int i,j,mid;
. H8 ~  |8 i( |7 \0 y, @: o7 Li=1;j=n;
while(i<=j)
/ h# N0 e9 I) B7 X{mid=(i+j)/2;
if(k==array[mid]) return(mid);
else if(k
else i=mid+1;
}
return(0);
}
/*冒泡排序法*/
void mpsort(int array[])
{int i,j,a;
2 C7 [  n1 e; O5 ia=0;
for(i=1;i
0 U7 A4 ~& W' O3 p8 u0 Vfor(j=i+1;j
) p5 c: G& d) Pif(array[i]>array[j])
' O7 z* r" C. @5 u$ n{a=array[i];
array[i]=array[j];
array[j]=a;}
}
/*直接插入排序*/
void insertsort(int array[])
1 I$ ^0 A+ L+ A2 F{int i,j;
* r* `1 y# h) Y  Ffor(i=2;i
{array[0]=array[i];
5 F) H0 C& h$ o; Jj=i-1;
) \3 P6 R( g  M4 ], N- b, zwhile(array[0]
{array[j+1]=array[j--];
array[j+1]=array[0];
0 W) s- _9 X% _: R* d}
}
+ B5 A: z) }2 E. w- P}
/*建立*/
5 S' N. |7 z" t3 r6 J2 I: F. Lvoid creat(int array[])
{int i;
printf("enter the array:\n");
for(i=1;i
  B; e& o) C. ]scanf("%d",&array[i]);
}
/*显示*/
void print(int array[])
8 l  ?& |% p3 Z/ n{int i;
printf("The numbers after sort is:\n");
for(i=1;i
$ K: T' a/ U! W1 B+ |7 aprintf("%d ",array[i]);
5 m  c3 J* j! s0 \. f8 Dprintf("\n");
}
main()
{int a[11],i,x,chang;
/*printf("enter the array\n");
7 ]6 @2 T* G) I6 cfor(i=1;i<11;i++)
  z) D: J; `3 L: ^0 W" i5 Yscanf("%d",&a[i]);*/
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:
$ K' x1 l" I8 F& C" V{creat(a);
6 S" ^" A) M  I3 o/ N) lprintf("Please int the search number:\n");
scanf("%d",&x);
" m6 W+ u& ?: e' u0 G) Wprintf("The number station is:%d\n",search(a,N,x));
goto aga;
}
case 2:
" j. \& P: C1 P& m{ creat(a);
insertsort(a);
print(a);
printf("Please int the search number:\n");
scanf("%d",&x);
5 V' @) y+ C6 j0 ]/ l" Oprintf("The number station is:%d\n",halfsearch(a,N,x));
; V+ Y- K" E+ N7 x- Q% ygoto aga;
7 l6 U. ]$ D& m+ z- Q}
. h0 a$ W. G- H$ z" Scase 3:
9 p3 A3 Q  d5 d+ g7 m" @' h{creat(a);
insertsort(a);
, J; w; W$ n: B0 R) E: \6 i( n! rprint(a);
7 ]6 ^' s3 o, c7 egoto aga;
% d2 t- H. S% c2 ^$ n9 N& S. L1 B}
& J9 _0 B" Q0 ]$ g# K4 Bcase 4:
6 ~/ [& O# K- f8 Q% S1 W{creat(a);
; _, T% ~7 t& r/ u5 @mpsort(a);
print(a);
goto aga;
3 E+ p! l8 Y/ \# T}
, ^+ z; p) u6 G5 {( N' o* r8 Y. A5 f7 Hcase 5:{ printf("exit!\n");break;}
/ o: E; f7 \) V4 x  Y% l6 e3 pdefault:{printf("Error!\n"); goto aga;}
}
}
4 u- o5 h" A+ O

xushu

数据结构学得不错！

gl1990119

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