CÓïÑÔ³ÌÐòÉè¼ÆÁ·Ï°Ì⣨º¬³ÌÐò¼°²Î¿¼´ð°¸£© ÏÂÔØ±¾ÎÄ

2010-2011 CÓïÑÔ³ÌÐòÊÔÌâ¼°´ð°¸

void main()

{ char a[N]=\ int i;

printf(\ insert(a);

printf(\}

30¡¢¼Ù¶¨ÕûÊýÊý×éaÖÐÔªËØµÄÖµ²»Öظ´¡£É¾³ýaÖÐֵΪxµÄÔªËØ£¨x´Ó¼üÅÌÊäÈ룩¡£ #include #define N 20

fun(int *a,int n,int x) { int p=0,i; a[n]=x; while(x!=a[p]) p=p+1;

if(p==n)

return -1;

else {

for(i=p;i

µÚ 29 Ò³ ¹² 46 Ò³

2010-2011 CÓïÑÔ³ÌÐòÊÔÌâ¼°´ð°¸

}

void main()

{ int w[N]={-3,0,1,5,7,99,10,15,30,90},x,n,i; n=10;

printf(\ for(i=0;i

printf(\ n=fun(w,n,x);

if (n==-1) printf(\ else

{ printf(\ for(i=0;i

printf(\ } }

31¡¢Ò»¸öÒѰ´´ÓСµ½´óµÄ˳ÐòÅźõÄÊý×éa£¬±àд³ÌÐò£¬´Ó¼üÅÌÊäÈëÒ»¸öÊýx°´Ô­À´ÅÅÐòµÄ¹æÂɽ«Ëü²åÈëÊý×éaÖС£ #include #define M 20

void InSort( int *n, int vv[], int k ) {

int i=0 , j;

while ( k > vv[i] && i < *n ) i++;

µÚ 30 Ò³ ¹² 46 Ò³

x (to

2010-2011 CÓïÑÔ³ÌÐòÊÔÌâ¼°´ð°¸

if ( i<*n )

for ( j=*n; j>i; j-- ) vv[j] = vv[j-1]; vv[i] = k;

++*n; }

void main() {

int aa[M], i, k, m; system(\

printf( \ scanf( \

printf( \ for( i = 0; i < m; i++ ) scanf( \

printf( \ scanf( \ InSort( &m, aa, k );

for(k=0; k < m;k++)

printf( \}

32¡¢Ê¹ÓÃÊý×éµÄ·½·¨É¸Ñ¡³ö1-100ÖеÄËØÊý #include void fun ( int *pt ) {

µÚ 31 Ò³ ¹² 46 Ò³

2010-2011 CÓïÑÔ³ÌÐòÊÔÌâ¼°´ð°¸

int i,j,flag; *pt=2;*pt++; for(i=3;i<100;i++) {

flag = 1; for(j=2;j

*pt = i;*pt++; } } *pt=0; }

void main( ) {

int *pointer,a[30]; pointer=a; fun(pointer);

printf(\ while(*pointer)

printf ( \ }

33¡¢ÒÑÖªÒ»¸öÊý×éaÖаüÀ¨10¸öÕûÊýÔªËØ£¬´ÓaÖеڶþ¸ö

µÚ 32 Ò³ ¹² 46 Ò³