排序与查找方法

厚积薄发

#include
#include
! {; ~5 Z. Z2 s1 J# q  h* M+ D#define N 11
/*用**哨查找*/
int search(int array[],int n,int k)
{int i;
i=n-1;
! ?6 r+ ~& l+ N3 ~array[0]=k;
while(array[i]!=k) i--;
return(i);
" v1 ]- j' t$ }# h# e* s8 ~}
/*折半查找法*/
5 u) s7 D8 `5 g5 o! U* P+ u* Cint halfsearch(int array[],int n,int k)
% y2 C  M* x6 W3 c{int i,j,mid;
  V# f  j4 F% s% N9 `i=1;j=n;
while(i<=j)
+ Z, G3 N* _& [+ z3 q" _{mid=(i+j)/2;
if(k==array[mid]) return(mid);
3 d' \  z. I* U# Z1 q, velse if(k
else i=mid+1;
}
3 e; Z9 @5 E1 Mreturn(0);
8 P8 t, f  k4 a% b) [2 o# n}
- B) o' X8 a4 m" }/*冒泡排序法*/
+ @+ W7 {( @" Rvoid mpsort(int array[])
; M! A9 M+ Y+ j( p5 f4 Z# J- d{int i,j,a;
8 V# I. [9 h' U: \" ]% ba=0;
for(i=1;i
3 S5 w+ {2 m9 F8 r4 M; ^1 Zfor(j=i+1;j
if(array[i]>array[j])
{a=array[i];
array[i]=array[j];
" k2 k7 k7 y! v/ B! C) y' t# farray[j]=a;}
- L" \3 K. x* g. c4 _. r$ {}
' T5 U7 D3 G: v8 ?7 ~/*直接插入排序*/
void insertsort(int array[])
1 W# v: }- }0 ~, U5 P; ^3 H9 Z{int i,j;
for(i=2;i
{array[0]=array[i];
j=i-1;
+ @% T, r6 g, D: v- I2 J" J& Pwhile(array[0]
+ ?) S1 O, d6 G. V" b9 ^" }{array[j+1]=array[j--];
array[j+1]=array[0];
}
}
) T3 s- }* Q. d) C}
4 e. {6 g7 [/ @8 g. A) f6 E! G/*建立*/
0 e; b2 B% i, \6 _. Tvoid creat(int array[])
{int i;
9 q: j2 S0 ~6 qprintf("enter the array:\n");
for(i=1;i
1 a3 L! t1 l* J, Z% M2 j; bscanf("%d",&array[i]);
}
. ?# T" n' c  p; q! y/*显示*/
void print(int array[])
{int i;
printf("The numbers after sort is:\n");
7 D7 L0 j) u7 j" X+ x0 Jfor(i=1;i
0 X8 o! F( N; w( Nprintf("%d ",array[i]);
* ?0 B' J* ~6 @" Z# N! V' Fprintf("\n");
}
main()
{int a[11],i,x,chang;
/*printf("enter the array\n");
2 N, R, E( M# m6 Y7 A* Ofor(i=1;i<11;i++)
scanf("%d",&a[i]);*/
) s" T! F7 D/ S% l" ?aga:
7 J! v) i) r$ s. ^8 q# vprintf("\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);
3 A) I% R% ?$ fswitch (chang)
{case 1:
{creat(a);
; [) h7 |& K  `, y5 hprintf("Please int the search number:\n");
0 h/ C; I. m, o) T9 L& t6 r, P( vscanf("%d",&x);
$ D8 t; z, i% ~2 I8 d: Rprintf("The number station is:%d\n",search(a,N,x));
1 j* S7 l6 T# t. `- }7 H# c* Vgoto aga;
! H$ ?9 [' Q* b# g}
case 2:
{ creat(a);
! n+ Q8 n" g* R# \insertsort(a);
print(a);
printf("Please int the search number:\n");
  `) n/ {# [) }# W4 hscanf("%d",&x);
printf("The number station is:%d\n",halfsearch(a,N,x));
goto aga;
}
case 3:
" Q' k: _4 b* _- R) e{creat(a);
insertsort(a);
print(a);
goto aga;
}
case 4:
% T1 ^7 G. @% u& l: S{creat(a);
" f& b8 i6 \# [7 m& D' q; Lmpsort(a);
print(a);
goto aga;
}
case 5:{ printf("exit!\n");break;}
" R3 Z6 }1 f6 v0 B6 S8 `default:{printf("Error!\n"); goto aga;}
}
}
2 {8 H; M/ t2 N! v) n; F" O
2 I( Y) z2 }5 q# ]( n7 T

gl1990119

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

xushu

数据结构学得不错！