计算机C语言精讲,双语.pptVIP

Chap 7 arrays 数 组 ;7.2 one-dimensional arrays;2、array item; initialization of one-demensional array; int b[5] = {1, 2, 3}; b[0] = 1, b[1] = 2, b[2] = 3, b[3] = ?, b[4] = ? int a[ ] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};; for(i = 0; i n; i++) printf(%d , a[i]); ;Input 10 numbers ,save them in arrays, then print them ;Calculate and print the first m Fibonacci numbers 1, 1, 2, 3, 5, 8, 13, …… f[0] = f[1] = 1 f[n] = f[n-1] + f[n-2] 2≤n≤19;#include stdio.h int main(void) { int i; int fib[20] = {1, 1}; for(i = 2; i 20; i++) fib[i] = fib[i - 1] + fib[i - 2]; for(i = 0; i 20; i++){ printf(%6d, fib[i]); if((i + 1) % 5 == 0) printf(\n); } return 0; } ;Input 5 integers ，save them in array ，then input one number x， to find x in array， if you can find，print it’s subscript, otherwise print “Not Found”。 Input ：2 9 8 9 6 9 Output ：1 Input ：2 9 8 9 6 7 output：Not Found;#include stdio.h int main(void) { int i, flag, x; int a[5]; printf(“Enter 5 integers: ); for(i = 0; i 5; i++) scanf(%d, a[i]); printf(“Enter x: ); scanf(%d, x); flag = 0; for(i = 0; i 5; i++) if(a[i] == x){ printf(Index is %d\n, i); flag = 1; break; } if(flag == 0) printf(Not Found\n); return 0; } ;Output minimum;#include stdio.h int main(void) { int i, min, n; int a[10]; printf(“Enter n: ); scanf(%d, n); printf(“Enter %d integers: , n); for(i = 0; i n; i++) scanf(%d, a[i]); min = a[0]; for(i = 1; i n; i++) if(a[i] min) min = a[i]; printf(min is %d \n, min); return 0; };Input m numbers, then print the minimum and subscript Index is subscript of minimum a[index] is minimum ;#include stdio.h int main(void) { int i, index, n; int a[10]; printf(“Enter n: ); scanf(%d, n); printf(“Enter %d inte