p.130 p.198 p.208 2 1
double weight[num]; double min, max; min = max = weight[0]; for( i= 1; i < NUM; i++ ) if ( weight[i] > max ) max = weight[i]: if ( weight[i] < min ) min = weight[i]: weight 3 maxof(a, b); int maxof( int x, int y ) maxof(a, bc); int maxof( int x, int yint z ) 4 2
main int eng[5]; /* / int max_e; /* / eng max_e = maxof( eng, 5 ); [] mainengmaxo fvc int maxof( int vc[], int no ) int vc[0]vc[4] main eng[0] eng[1] eng[2] eng[3] vc[0] vc[1] vc[2] vc[3] maxof eng[4] vc[4] 5 list0611.c (p.130) #define NUMBER5 int max_of(int vc[], int no) int i; int max = vc[0]; for (i = 1; i < no; i++) if (vc[i] > max) max = vc[i]; return (max); int i; int eng[number]; int mat[number]; int max_e, max_m; printf("%d\n", NUMBER); for (i = 0; i < NUMBER; i++) printf("[%d] ", i + 1); scanf("%d", &eng[i]); printf( " "); scanf("%d", &mat[i]); max_e = max_of(eng, NUMBER); max_m = max_of(mat, NUMBER); printf("%d\n", max_e); printf("%d\n", max_m); return (0); 6 3
main int na, nb, max; na = 24; nb = 62; max = maxof( na, nb ); return int maxof( int x, int y ) na, nbx, y if (x > y) return (x); else return (y); 7 8 4
include <stdio.h> void set_value( int x, int y ) x = 0; y = 0; int na, nb; na = 10; nb = 5; set_value( na, nb ); printf( na= %d\n, na ); printf( nb= %d\n, nb ); return (0); 9 include <stdio.h> void set_value( int vc[] ) vc[0] = 0; vc[1] = 0; int x[2]; x[0] = 10; x[1] = 5; set_value( x ); printf( x[0]= %d\n, x[0] ); printf( x[1]= %d\n, x[1] ); return (0); main x[0] x[1] = = vc[0] vc[1] set_value 0 0 10 5
list0612.c (p.132) 11 x, int x = 77; void print_x1(void) int x = 777; void print_x2(void) printf( "x = %d\n", x ); int x=7; print_x1(); print_x2(); return(0); 12 6
int x = 77; int x=7; main void print_x1(void) int x = 777; void print_x2(void) printf( "x = %d\n", x ); print_x1(); print_x2(); return(0); main 13 int x = 77; int x=7; print_x1(); print_x2(); main return(0); 14 7
x, int x = 77; int x=7; void print_x1(void) int x = 777; void print_x2(void) printf( "x = %d\n", x ); print_x1(); print_x2(); return(0); 15 main #include, #definemain 16 8
count.c int count = 0; int i; void func1(void) printf( fun1 was called\n" ); count++; void func2(void) printf( fun2 was called\n" ); count++; func1(); func2(); for(i=0; i < 5; i++) func1(); for(i=0; i < 3; i++) func2(); printf( count = %d\n", count ); return(0); 17 list0619.c int fx = 0; void func(void) static int sx = 0 ; int ax = 0; printf("%3d%3d%3d\n", ax++, sx++, fx++); int i; puts(" ax sx fx"); puts("----------"); for (i = 0; i < 10; i++) func(); puts("----------"); return (0); ax sx fx -------------- 0 0 0 0 1 1 0 2 2 0 3 3 18 9
-1kadai6-1.c int search_value( int x[ ], int key ); -1 5 int5 5 search_value search_value 19 N kadai6-2c A80-100 : **** B70-79 : ******* C60-69 : **** D 0-59 void display_graph( int tensu[ ], int num ); kadai6-3.c void heikin_bunsan( int tensu[ ], int num ); 20 10