排序与查找方法

厚积薄发

#include
#include
#define N 11
/*用**哨查找*/
2 |; f; l7 T$ p7 v2 u! Gint search(int array[],int n,int k)
{int i;
i=n-1;
array[0]=k;
' [9 x. ]& R5 Iwhile(array[i]!=k) i--;
return(i);
/ O- i- i+ d" T# _8 h& u8 P8 F}
1 ?; j* y( e3 ^9 m7 k/ w6 C5 g' L/*折半查找法*/
* Y) q8 \- H' l1 u4 U7 F1 b: Wint halfsearch(int array[],int n,int k)
{int i,j,mid;
i=1;j=n;
while(i<=j)
1 e. E1 _, i1 u7 D; ?: e2 v0 `{mid=(i+j)/2;
if(k==array[mid]) return(mid);
else if(k
else i=mid+1;
}
! b. o& F% H+ e( b/ n& Wreturn(0);
2 \! ]. u& b0 p9 I}
+ M3 x4 m) t; k$ Y0 [/*冒泡排序法*/
void mpsort(int array[])
2 ^& d( Y% I8 n& P& Y3 G3 p{int i,j,a;
8 i  y3 j9 L1 f7 ^1 @a=0;
0 ]  k1 b" |) u0 d$ @for(i=1;i
. N' {3 K& M6 d' j2 U! pfor(j=i+1;j
if(array[i]>array[j])
# I% x7 N4 O5 g+ D, x8 b{a=array[i];
array[i]=array[j];
array[j]=a;}
}
/ X4 m% A1 s; g; _2 u/*直接插入排序*/
8 a& U4 d. t- g5 P- lvoid insertsort(int array[])
' N3 X7 J( x2 K# U. _{int i,j;
- V, ?2 p0 y: g4 A: |+ [: afor(i=2;i
{array[0]=array[i];
j=i-1;
while(array[0]
1 G. g7 S) \, z! i6 Y) a6 [# E8 d/ o6 A{array[j+1]=array[j--];
array[j+1]=array[0];
}
}
}
/*建立*/
' [; ~7 N# L4 V* A4 S! h( ^void creat(int array[])
{int i;
3 ?" g8 F) e9 Bprintf("enter the array:\n");
5 U# ]8 l; V" i5 H8 @- Nfor(i=1;i
scanf("%d",&array[i]);
2 V6 B4 v8 Z" ^) R' T4 ~# I' C; d}
. i1 }8 m; o, r3 v" i: X/*显示*/
void print(int array[])
+ C; ^4 }+ \3 U$ `+ ]5 r{int i;
printf("The numbers after sort is:\n");
" l) k. _) b; X" H8 B& j) Y: n% yfor(i=1;i
printf("%d ",array[i]);
printf("\n");
}
main()
5 \) M$ r6 v3 d{int a[11],i,x,chang;
/*printf("enter the array\n");
for(i=1;i<11;i++)
: F- S" ?" C$ `7 escanf("%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");
' {" N6 P6 B/ j( h5 D0 Cscanf("%d",&chang);
switch (chang)
; P/ I& I1 W  Q# b3 E& `{case 1:
/ g- M& ]% b7 J. j' P- J1 N$ J{creat(a);
printf("Please int the search number:\n");
scanf("%d",&x);
/ }' i1 m' |) gprintf("The number station is:%d\n",search(a,N,x));
goto aga;
}
case 2:
{ creat(a);
6 ?/ U" G: ]: z$ s4 minsertsort(a);
. S5 o6 R/ s7 X1 }# `8 O0 yprint(a);
* V2 h" @' Q+ g- {. m$ c+ C9 [printf("Please int the search number:\n");
scanf("%d",&x);
printf("The number station is:%d\n",halfsearch(a,N,x));
goto aga;
% @  V9 H2 d, g& u" N  ~}
case 3:
0 i' q5 {4 I4 }{creat(a);
insertsort(a);
/ {) i$ r" O- oprint(a);
8 b# S" S( O9 Egoto aga;
}
case 4:
) g7 U$ r: R& F. _6 Y5 v. L; @8 _{creat(a);
mpsort(a);
2 @& d% N5 r) R. o  e: Qprint(a);
) x+ p9 m7 e, K8 H$ K+ ogoto aga;
) C$ m9 L+ X! a7 {0 f& c}
case 5:{ printf("exit!\n");break;}
default:{printf("Error!\n"); goto aga;}
/ P5 W1 i0 s# O5 a; A( e}
. `+ W1 b7 R6 }2 ~9 v}

gl1990119

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

xushu

数据结构学得不错！