(Optional Notes)

Commentary

Fixed-Size Arrays

Typically when we speak about 'arrays' we are referring to a contiguous block of memory that is established at compile-time. That is, in our source code, somewhere we are saying -- I want '6 integers' to be grouped next to each other, and then I can conveniently access each of those integers using an offset.

// An example creating an array of 6 integers.
int myData[6];

TODO Add illustration showing 0-based index and each uninitialized piece of memory.

// An example initializing an array and each of the 6 integers.
int myData[6] = {2,4,6,8,10,12};

In the example above, we initialize our memory.

// Compiler inferring the size of 6 elements here.
int myData[] = {2,4,6,8,10,12};

We can also 'infer' the size of our array as shown above, and omit the 6 elements.

Improving Fixed-Size Arrays with std::array

In Modern C++, starting with C++11, we can use std::array<int,6> myData; to equivalently create an array of 6 integers.

Dynamic memory allocation at run-time of an array.

TODO

1. Show an example.
2. Remind that we need to do this for large allocations.

The process of resizing an 'array'

TODO Talk about copying an array to a new size, and then 'pointing' to a new elemnet.

Big-O operations on an array

Dynamically sizing arrays.

TODO:

1. Talk about std::vector
2. Talk about how to expand a vector and the amortized cost of doing so.
3. Talk about 'inserting' in the middle of a std::vector

Big-O operations on a std::vector

TODO