排序与查找方法

厚积薄发

#include
3 L0 i; ?! B. Z0 O% ^#include
#define N 11
/*用**哨查找*/
int search(int array[],int n,int k)
: i% a5 }4 O: y- R) \* @, I{int i;
i=n-1;
array[0]=k;
while(array[i]!=k) i--;
return(i);
, }5 R3 K2 J+ Z2 m}
/*折半查找法*/
# t+ e5 X9 v; T1 r; sint halfsearch(int array[],int n,int k)
; O" K1 z* _; i5 t* U) q{int i,j,mid;
. e7 b( Z. |, M' P/ ui=1;j=n;
. h  R7 W' {! I; d  v6 i) {while(i<=j)
{mid=(i+j)/2;
* ?* C, _! S  D4 W/ p! Bif(k==array[mid]) return(mid);
else if(k
4 H, M6 O) D* |& M6 delse i=mid+1;
}
* e3 h& a3 V  g% F& w3 ^return(0);
}
/*冒泡排序法*/
void mpsort(int array[])
# @# q+ Q# x  j, V{int i,j,a;
a=0;
for(i=1;i
for(j=i+1;j
0 W8 F% {0 W3 h- a( zif(array[i]>array[j])
& P5 D! ]+ \7 \1 X) `& G{a=array[i];
array[i]=array[j];
array[j]=a;}
# |3 t3 t( R# t7 i}
/*直接插入排序*/
void insertsort(int array[])
{int i,j;
/ S$ o+ H" j" X/ tfor(i=2;i
' c' D* A0 N( [4 u( r{array[0]=array[i];
: G1 P: L6 G% k! `1 P$ s4 `; S# @j=i-1;
! L2 b6 E) \8 z3 P# e1 Uwhile(array[0]
& y9 ^+ w; p2 J4 Y' ?0 C  C: l{array[j+1]=array[j--];
array[j+1]=array[0];
* X) u' p$ O+ M: H7 C+ l# k- X}
}
}
8 m1 t4 ?% j  P& `* w/*建立*/
void creat(int array[])
  e# F) G' D8 h! c) Q{int i;
& j( d, C8 S7 u3 a& a3 l/ Oprintf("enter the array:\n");
% T7 i1 `  e+ l' S& K% Ifor(i=1;i
scanf("%d",&array[i]);
+ v7 ~! L2 s, C1 Y; k}
4 c$ `/ Q  n. N6 n8 _0 z( [# M/*显示*/
void print(int array[])
8 G. |' L, m, e  s8 M. F8 Q& ~( n5 c4 s{int i;
% Z$ R& r* r- U8 h- l1 q% g) Xprintf("The numbers after sort is:\n");
for(i=1;i
- }, u2 |$ J) A+ Gprintf("%d ",array[i]);
- M) {, G  ?7 a/ z, ^. N3 s  qprintf("\n");
' V! D" R# C( o, q9 G}
main()
{int a[11],i,x,chang;
/*printf("enter the array\n");
for(i=1;i<11;i++)
- M$ f3 u$ n; v( r+ yscanf("%d",&a[i]);*/
, U  P* Y0 ~# I& naga:
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");
  x) Y) M' N" c" d/ b8 Qscanf("%d",&chang);
+ s1 v: h& K' k2 g+ v5 xswitch (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:
% M$ u7 M1 t. u2 j) a{ creat(a);
insertsort(a);
' Z) N" B& w1 e& v) ]print(a);
9 |  d  G8 z- \) t7 C& \printf("Please int the search number:\n");
scanf("%d",&x);
printf("The number station is:%d\n",halfsearch(a,N,x));
) Y/ E) u# x: i( S& S# B$ Ggoto aga;
}
case 3:
{creat(a);
, X8 }- g8 n) G: V7 S+ n9 ginsertsort(a);
print(a);
! ^! S, o2 [; agoto aga;
}
5 h! P6 f6 R7 z1 H( ^" Icase 4:
' f7 u4 {* b5 b7 n. S/ }! }$ l7 ~7 q{creat(a);
, k8 g4 O% W4 c: Empsort(a);
print(a);
goto aga;
9 i- W+ u" a% J. c}
case 5:{ printf("exit!\n");break;}
/ Q$ D' h# W1 h, W8 adefault:{printf("Error!\n"); goto aga;}
# q' n  B( X# q, q) y}
}
7 Q- L" y: p5 k3 v, O7 V; y5 E
# A# f, B3 c6 y" H' d

gl1990119

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

xushu

数据结构学得不错！