Another question regarding pointers! Oh I do love them ...
are some lecture notes on some pointer array stuff. (I am unsure on the legalities of copy-pasting the text in here.) I can follow it all up to where there are descriptions of allocating the memory for a 3 dimensional array. The first example makes sense. however, the last example which is 'much more efficient' is a mystery to me.
Can someone explain to me how it is working? Hopefully with some diagrams. I have tried drawing diagrams, although end up with squares connected with many lines to many squares as if a I had squashed a spider on my desk. Also, why is it much more efficient? Is this in terms of time to allocate, or time when accessing them later? (Surely, the latter doesn't make sense.)