main( ) {int i, a[10]={3, 7, 9, 11, 0, 6, 7, 5, 4, 2}; printf(“the original array:\ n”); for(i=0; i10; i++) printf(“%d,”, a[i]); printf(“\n”); inv(a, 10); printf(“the array has been inverted:\n”); for(i=0; i10; i++) printf(“%d,” , a[i]); printf(“\ n”); } 3 2 7 4 9 5 11 7 0 6 6 0 7 11 5 9 4 7 2 3 a[0] a[1] a[2] a[3] a[4] a[5] a[6] a[7] a[8] a[9] i,x P=x+m j t ?3, * i ?2, * j ?3 t ?7, * i ?4, * j ?7 t ?9, * i ?5, * j ?9 t ?11, * i ?7, * j ?11 t ?0, * i ?6, * j ?0 例10_8:从10个数中找出最大值和最小值, 并分别存入全局 量max, min中,在查找过程中 指针p:
原创力文档

文档评论(0)