| Other Data Structures |
|
|
|
|
|
|
|
|
|
|
|
| • | So,
assume that we have built a flexible array and |
|||||||||
| we
are interested in accessing the 15th data item |
||||||||||
| (i.e.,
by position) |
||||||||||
| node * current = head; |
||||||||||
| int traverse = dposition/SIZE; |
||||||||||
| while (--traverse && current) { |
||||||||||
| current = current->next; |
||||||||||
| if (current) cout << |
||||||||||
| current->fixed_array[dposition%SIZE]; |
||||||||||