Today’s lecture covered the following topics:
- full looping syntax for dynamic allocation and deletion of multi-dimensional arrays
- a discussion of the ability to now create arbitrarily shaped (instead of rectangular) arrays (useful for symmetric matrices among other situations)
- a discussion of the notion that dynamic allocation does not guarantee contiguous memory locations across memory requests
- the + and - operators and their functionality when applied to pointer types
The programs that were demonstrated were:
- dynamicAddresses.cpp (demonstration of memory addresses given out from heap when dynamic memory allocation used)
- traversingArrays.cpp (different techniques for traversing down arrays, including using pointer arithmetic (+ on pointers))
