| <<< Count algoritm example | Index | Copy algoritm example >>> |
array name is the address of the zeroth element
array name is a constant address
a[ 1 ] is equivalent to ( a + 1 )[ 0 ]
a[ n ] is equivalent to *( a + n )
Half-open address range concept:
int a[ 10 ] = { 15, 20, 25, 30, 35, 40, 45, 50, 55, 60 };
| a[0] | a[1] | a[2] | a[3] | a[4] | a[5] | a[6] | a[7] | a[8] | a[9] | |
| 15 | 20 | 25 | 30 | 35 | 40 | 45 | 50 | 55 | 60 | ??? |
(a + 10) is the address one-beyond the end of an array.
| <<< Count algoritm example | Index | Copy algoritm example >>> |