12 1. multi-dimensional array
1 like465 views
![2
Two-Dimensional Arrays
則 2谿 覦一 Syntax
data_type variable_name[ number][ number ];
Array dimensions
Declarations of arrays Remarks
int a[100]; a one-demensional array
int b[2][7]; a two-demensional array
int c[5][3][2]; a three-demensional array](https://image.slidesharecdn.com/12-1-140406045931-phpapp01/85/12-1-multi-dimensional-array-2-320.jpg)
![3
Two-Dimensional Arrays
則 int a[3][4] 朱Μ 覦一
a[0][0] a[0][1] a[0][2] a[0][3]
a[1][0] a[1][1] a[1][2] a[1][3]
a[2][0] a[2][1] a[2][2] a[2][3]
row 0
row 1
col 0 col 1 col 2 col 3
row 2](https://image.slidesharecdn.com/12-1-140406045931-phpapp01/85/12-1-multi-dimensional-array-3-320.jpg)
![4
Two-Dimensional Arrays
則 Two-Demensional Arrays #include <stdio.h>
#define M 3 /* number of rows */
#define N 4 /* number of columns */
int main(void){
int a[M][N], i, j, sum = 0;
for ( i = 0; i < M; ++i )
for ( j = 0; j < N; ++j )
a[i][j] = i + j;
for ( i = 0; i < M; ++i ) {
for ( j = 0; j < N; ++j )
printf(a[%d][%d] = %d ,
i, j, a[i][j] );
printf(n);
}
return 0;
}
a[0][0] = 0 a[0][1] = 1 a[0][2] = 2 a[0][3] = 3
a[1][0] = 1 a[1][1] = 2 a[1][2] = 3 a[1][3] = 4
a[2][0] = 2 a[2][1] = 3 a[2][2] = 4 a[2][3] = 5](https://image.slidesharecdn.com/12-1-140406045931-phpapp01/85/12-1-multi-dimensional-array-4-320.jpg)
![5
Two-Dimensional Arrays
則 int a[3][4] 覓朱Μ 覦一
伎姶 覦一伎 れ襦 貉危 覃覈襴 ル 螳
殊姶 覦一伎 覦一
a[0][0] a[0][1] a[0][2] a[0][3] a[1][0] a[1][1] a[1][2] a[1][3] a[2][0] a[2][1] a[2][2] a[2][3]
row 0 row 1 row 2
1000 1016 1032](https://image.slidesharecdn.com/12-1-140406045931-phpapp01/85/12-1-multi-dimensional-array-5-320.jpg)
![6
Two-Dimensional Arrays
[Ex]
int a[2][3], *p ;
p = &a[0][0];
p + 0 尊 &a[0][0] 尊 a[0] + 0
p + 1 尊 &a[0][1] 尊 a[0] + 1
p + 2 尊 &a[0][2] 尊 a[0] + 2
p + 3 尊 &a[1][0] 尊 a[0] + 3 尊 a[1] + 0
p + 4 尊 &a[1][1] 尊 a[0] + 4 尊 a[1] + 1
p + 5 尊 &a[1][2] 尊 a[0] + 5 尊 a[1] + 2
a[0][0] a[0][1] a[0][2] a[1][0] a[1][1] a[1][2]](https://image.slidesharecdn.com/12-1-140406045931-phpapp01/85/12-1-multi-dimensional-array-6-320.jpg)
![Two-Dimensional Arrays
則 int a[3][4] 覓朱Μ 覦一
int a[3][4] 螳 1000覯讌 れ 螳?
7
a = ?
a + 1 = ?
a[0] = ?
a[0] + 1 = ?
a[1] = ?
a[1] + 1 = ?
a[0][0] a[0][1] a[0][2] a[0][3] a[1][0] a[1][1] a[1][2] a[1][3] a[2][0] a[2][1] a[2][2] a[2][3]
a[0] a[1] a[2]
1000 1016 1032](https://image.slidesharecdn.com/12-1-140406045931-phpapp01/85/12-1-multi-dimensional-array-7-320.jpg)
![8
Two-Dimensional Arrays
則 int a[3][4] 覓朱Μ 覦一
a 企, type int (*)[4]
a[0], a[1], a[2] 企, type int*
a[0][0] a[0][1] a[0][2] a[0][3] a[1][0] a[1][1] a[1][2] a[1][3] a[2][0] a[2][1] a[2][2] a[2][3]
a[0] a[1] a[2]
1000 1016 1032
&a[0][0] ==a[0]==(int*)1000 &a[1][0]==a[1]==(int*)1016 &a[2][0]==a[2]==(int*)1032
a==&a[0]=(int**)1000 (a+1)==&a[1]=(int**)1016 (a+2)==&a[2]=(int**)1032](https://image.slidesharecdn.com/12-1-140406045931-phpapp01/85/12-1-multi-dimensional-array-8-320.jpg)
![9
Two-Dimensional Arrays
則 2谿 覦一 element襯 access 螳讌 覦覯
a[ i ] a i覯讌
a[ i ][ j ] 覦一伎 i覯讌 螻 j覯讌 伎
覦一 企 a &a[0] 螳.
Expressions equivalent to a[ i ][ j ]
*( a[ i ] + j )
( *( a + i ) ) [ j ]
*( ( *( a + i ) ) + j )
*( &a[0][0] + 4 * i + j )
int a[3][4]](https://image.slidesharecdn.com/12-1-140406045931-phpapp01/85/12-1-multi-dimensional-array-9-320.jpg)
![10
Two-Dimensional Arrays
#include <stdio.h>
int main() {
int a[3][4], j, k, sum = 0 ;
for( j = 0 ; j < 3 ; j++ )
for( k = 0 ; k < 4 ; k++ )
scanf( %d, &a[j][k] ) ;
for( j = 0 ; j < 3 ; j++ )
for( k = 0 ; k < 4 ; k++ )
sum += a[j][k] ;
printf( %dn, sum ) ;
return 0;
}
則 2谿覦一伎 蠍郁鍵
#include <stdio.h>
int sum(?????) { ... }
int main() {
int a[3][4], j, k, sum = 0 ;
for( j = 0 ; j < 3 ; j++ )
for( k = 0 ; k < 4 ; k++ )
scanf( %d, &a[j][k] ) ;
printf( %dn, sum(????) ) ;
return 0;
}](https://image.slidesharecdn.com/12-1-140406045931-phpapp01/85/12-1-multi-dimensional-array-10-320.jpg)
![11
Two-Dimensional Arrays
則 2谿覦一伎 蠍郁鍵
int sum( int num[][4], int size )
{
for( j = 0 ; j < size ; j++ )
for( k = 0 ; k < 4 ; k++ )
sum += num[j][k] ;
}
printf( %dn, sum(a, 3) ) ;
int (*num)[4]](https://image.slidesharecdn.com/12-1-140406045931-phpapp01/85/12-1-multi-dimensional-array-11-320.jpg)
![則 2谿覦一伎 蠍郁鍵
願 蟾?
Two-Dimensional Arrays
12
int sum( int num[][], int size0, int size1 )
{
for( j = 0 ; j < size0 ; j++ )
for( k = 0 ; k < size1 ; k++ )
sum += num[j][k] ;
}
printf( %dn, sum(a, 3, 4) ) ;
int num[3][4]
num[i][j] 手 磯, C compiler 願 *(base_address + 4*i + j)襦 覲.
(谿瑚: C 語 企朱 num[i][j]朱 譟伎讌 )
磯殊, 覯讌 蠍一 4襯 覈讌 朱, num[i][j]襯 *(base_address + 4*i + j)
襦 覲 .](https://image.slidesharecdn.com/12-1-140406045931-phpapp01/85/12-1-multi-dimensional-array-12-320.jpg)
![Two-Dimensional Arrays
則 2谿覦一伎 蠍郁鍵
蠏碁 蟲褐 蠏碁 朱 螻 矩る,
2谿覦一伎 1谿覦一企 覲
13
int sum( int num[], int size0, int size1 )
{
for( j = 0 ; j < size0 ; j++ )
for( k = 0 ; k < size1 ; k++ )
sum += *(num+ size1*j + k) ;
}
printf( %dn, sum( (int*)a, 3, 4) ) ;](https://image.slidesharecdn.com/12-1-140406045931-phpapp01/85/12-1-multi-dimensional-array-13-320.jpg)
![14
Multidimensional Arrays
則 3谿覦一伎 蠍郁鍵
int sum( int num[][4][5], int size )
{
for( j = 0 ; j < size ; j++ )
for( k = 0 ; k < 4 ; k++ )
for( l = 0 ; l < 5 ; l++ )
sum += num[j][k][l] ;
}
printf( %dn, sum(a, 3) ) ;
int (*num)[4][5]](https://image.slidesharecdn.com/12-1-140406045931-phpapp01/85/12-1-multi-dimensional-array-14-320.jpg)
![Multidimensional Arrays
則 3谿覦一伎 蠍郁鍵
1谿 覦一 誤磯 覲 蠍郁鍵
15
int sum( int num[], int s0, int s1, int s2 )
{
for( j = 0 ; j < s0 ; j++ )
for( k = 0 ; k < s1 ; k++ )
for( l = 0 ; l < s2 ; l++ )
sum += *(num+ s1*s2*j + s2*k + l) ;
}
printf( %dn, sum((int*)a, 3, 4, 5) ) ;](https://image.slidesharecdn.com/12-1-140406045931-phpapp01/85/12-1-multi-dimensional-array-15-320.jpg)
![16
Multidimensional Arrays
則 れ姶 覦一伎 豐蠍壱
[Ex]
int a[ 2 ][ 2 ][ 3 ] = { { {1,1,0}, {2,0,0} }, { {3,0,0}, {4,4,0} } };
[Ex]
int a[ 2 ][ 2 ][ 3 ] = { 0 }; 覈 れ 0朱 豐蠍壱 .
[Ex]
int a[ ][ 2 ][ 3 ] = { { {1, 1}, {2} }, { {3}, {4, 4} } };
[Ex]
int a[ 2 ][ 2 ][ 3 ] = { 1, 1, 0, 2, 0, 0, 3, 0, 0, 4, 4, 0 } ;](https://image.slidesharecdn.com/12-1-140406045931-phpapp01/85/12-1-multi-dimensional-array-16-320.jpg)
![[蟆暑蠍一] 蟆暑-殊碁](https://cdn.slidesharecdn.com/ss_thumbnails/nn02-180318141341-thumbnail.jpg?width=560&fit=bounds)
![[蟆暑蠍一] 蠏覿](https://cdn.slidesharecdn.com/ss_thumbnails/nn07-180318142107-thumbnail.jpg?width=560&fit=bounds)
More Related Content
What's hot (20)
Viewers also liked (8)
Similar to 12 1. multi-dimensional array (20)
![[devil's camp] - 螻襴讀 STL (覦語)](https://cdn.slidesharecdn.com/ss_thumbnails/stl-160830021024-thumbnail.jpg?width=560&fit=bounds)
More from (20)
12 1. multi-dimensional array
- 2. 2 Two-Dimensional Arrays 則 2谿 覦一 Syntax data_type variable_name[ number][ number ]; Array dimensions Declarations of arrays Remarks int a[100]; a one-demensional array int b[2][7]; a two-demensional array int c[5][3][2]; a three-demensional array
- 3. 3 Two-Dimensional Arrays 則 int a[3][4] 朱Μ 覦一 a[0][0] a[0][1] a[0][2] a[0][3] a[1][0] a[1][1] a[1][2] a[1][3] a[2][0] a[2][1] a[2][2] a[2][3] row 0 row 1 col 0 col 1 col 2 col 3 row 2
- 4. 4 Two-Dimensional Arrays 則 Two-Demensional Arrays #include <stdio.h> #define M 3 /* number of rows */ #define N 4 /* number of columns */ int main(void){ int a[M][N], i, j, sum = 0; for ( i = 0; i < M; ++i ) for ( j = 0; j < N; ++j ) a[i][j] = i + j; for ( i = 0; i < M; ++i ) { for ( j = 0; j < N; ++j ) printf(a[%d][%d] = %d , i, j, a[i][j] ); printf(n); } return 0; } a[0][0] = 0 a[0][1] = 1 a[0][2] = 2 a[0][3] = 3 a[1][0] = 1 a[1][1] = 2 a[1][2] = 3 a[1][3] = 4 a[2][0] = 2 a[2][1] = 3 a[2][2] = 4 a[2][3] = 5
- 5. 5 Two-Dimensional Arrays 則 int a[3][4] 覓朱Μ 覦一 伎姶 覦一伎 れ襦 貉危 覃覈襴 ル 螳 殊姶 覦一伎 覦一 a[0][0] a[0][1] a[0][2] a[0][3] a[1][0] a[1][1] a[1][2] a[1][3] a[2][0] a[2][1] a[2][2] a[2][3] row 0 row 1 row 2 1000 1016 1032
- 6. 6 Two-Dimensional Arrays [Ex] int a[2][3], *p ; p = &a[0][0]; p + 0 尊 &a[0][0] 尊 a[0] + 0 p + 1 尊 &a[0][1] 尊 a[0] + 1 p + 2 尊 &a[0][2] 尊 a[0] + 2 p + 3 尊 &a[1][0] 尊 a[0] + 3 尊 a[1] + 0 p + 4 尊 &a[1][1] 尊 a[0] + 4 尊 a[1] + 1 p + 5 尊 &a[1][2] 尊 a[0] + 5 尊 a[1] + 2 a[0][0] a[0][1] a[0][2] a[1][0] a[1][1] a[1][2]
- 7. Two-Dimensional Arrays 則 int a[3][4] 覓朱Μ 覦一 int a[3][4] 螳 1000覯讌 れ 螳? 7 a = ? a + 1 = ? a[0] = ? a[0] + 1 = ? a[1] = ? a[1] + 1 = ? a[0][0] a[0][1] a[0][2] a[0][3] a[1][0] a[1][1] a[1][2] a[1][3] a[2][0] a[2][1] a[2][2] a[2][3] a[0] a[1] a[2] 1000 1016 1032
- 8. 8 Two-Dimensional Arrays 則 int a[3][4] 覓朱Μ 覦一 a 企, type int (*)[4] a[0], a[1], a[2] 企, type int* a[0][0] a[0][1] a[0][2] a[0][3] a[1][0] a[1][1] a[1][2] a[1][3] a[2][0] a[2][1] a[2][2] a[2][3] a[0] a[1] a[2] 1000 1016 1032 &a[0][0] ==a[0]==(int*)1000 &a[1][0]==a[1]==(int*)1016 &a[2][0]==a[2]==(int*)1032 a==&a[0]=(int**)1000 (a+1)==&a[1]=(int**)1016 (a+2)==&a[2]=(int**)1032
- 9. 9 Two-Dimensional Arrays 則 2谿 覦一 element襯 access 螳讌 覦覯 a[ i ] a i覯讌 a[ i ][ j ] 覦一伎 i覯讌 螻 j覯讌 伎 覦一 企 a &a[0] 螳. Expressions equivalent to a[ i ][ j ] *( a[ i ] + j ) ( *( a + i ) ) [ j ] *( ( *( a + i ) ) + j ) *( &a[0][0] + 4 * i + j ) int a[3][4]
- 10. 10 Two-Dimensional Arrays #include <stdio.h> int main() { int a[3][4], j, k, sum = 0 ; for( j = 0 ; j < 3 ; j++ ) for( k = 0 ; k < 4 ; k++ ) scanf( %d, &a[j][k] ) ; for( j = 0 ; j < 3 ; j++ ) for( k = 0 ; k < 4 ; k++ ) sum += a[j][k] ; printf( %dn, sum ) ; return 0; } 則 2谿覦一伎 蠍郁鍵 #include <stdio.h> int sum(?????) { ... } int main() { int a[3][4], j, k, sum = 0 ; for( j = 0 ; j < 3 ; j++ ) for( k = 0 ; k < 4 ; k++ ) scanf( %d, &a[j][k] ) ; printf( %dn, sum(????) ) ; return 0; }
- 11. 11 Two-Dimensional Arrays 則 2谿覦一伎 蠍郁鍵 int sum( int num[][4], int size ) { for( j = 0 ; j < size ; j++ ) for( k = 0 ; k < 4 ; k++ ) sum += num[j][k] ; } printf( %dn, sum(a, 3) ) ; int (*num)[4]
- 12. 則 2谿覦一伎 蠍郁鍵 願 蟾? Two-Dimensional Arrays 12 int sum( int num[][], int size0, int size1 ) { for( j = 0 ; j < size0 ; j++ ) for( k = 0 ; k < size1 ; k++ ) sum += num[j][k] ; } printf( %dn, sum(a, 3, 4) ) ; int num[3][4] num[i][j] 手 磯, C compiler 願 *(base_address + 4*i + j)襦 覲. (谿瑚: C 語 企朱 num[i][j]朱 譟伎讌 ) 磯殊, 覯讌 蠍一 4襯 覈讌 朱, num[i][j]襯 *(base_address + 4*i + j) 襦 覲 .
- 13. Two-Dimensional Arrays 則 2谿覦一伎 蠍郁鍵 蠏碁 蟲褐 蠏碁 朱 螻 矩る, 2谿覦一伎 1谿覦一企 覲 13 int sum( int num[], int size0, int size1 ) { for( j = 0 ; j < size0 ; j++ ) for( k = 0 ; k < size1 ; k++ ) sum += *(num+ size1*j + k) ; } printf( %dn, sum( (int*)a, 3, 4) ) ;
- 14. 14 Multidimensional Arrays 則 3谿覦一伎 蠍郁鍵 int sum( int num[][4][5], int size ) { for( j = 0 ; j < size ; j++ ) for( k = 0 ; k < 4 ; k++ ) for( l = 0 ; l < 5 ; l++ ) sum += num[j][k][l] ; } printf( %dn, sum(a, 3) ) ; int (*num)[4][5]
- 15. Multidimensional Arrays 則 3谿覦一伎 蠍郁鍵 1谿 覦一 誤磯 覲 蠍郁鍵 15 int sum( int num[], int s0, int s1, int s2 ) { for( j = 0 ; j < s0 ; j++ ) for( k = 0 ; k < s1 ; k++ ) for( l = 0 ; l < s2 ; l++ ) sum += *(num+ s1*s2*j + s2*k + l) ; } printf( %dn, sum((int*)a, 3, 4, 5) ) ;
- 16. 16 Multidimensional Arrays 則 れ姶 覦一伎 豐蠍壱 [Ex] int a[ 2 ][ 2 ][ 3 ] = { { {1,1,0}, {2,0,0} }, { {3,0,0}, {4,4,0} } }; [Ex] int a[ 2 ][ 2 ][ 3 ] = { 0 }; 覈 れ 0朱 豐蠍壱 . [Ex] int a[ ][ 2 ][ 3 ] = { { {1, 1}, {2} }, { {3}, {4, 4} } }; [Ex] int a[ 2 ][ 2 ][ 3 ] = { 1, 1, 0, 2, 0, 0, 3, 0, 0, 4, 4, 0 } ;