Why can't initial length be 1 in a dynamically-allocated array?-Collection of common programming errors

It’s not dynamic in the sense that it can dynamically resize itself. It’s dynamic in the sense that its size can be chosen dynamically at runtime, instead of compile time. One of the primary philosophies of C++ is that you don’t pay for what you don’t use. If dynamic arrays worked the way you are asking, that would require bounds checking, something I don’t need, so I don’t want to pay for it.

Anyway, the problem is solved with the standard library.

std::vector vec;
...
while (inputFile >> newValue)
{
    vec.push_back(newValue);
}

Isn’t that much nicer? You don’t even have to keep track of the size, because vector keeps track of it for you.

If you can’t use vector, then you’ve got a lot of work ahead of you. The principle is essentially this. You keep 2 additional integer variables. One to indicate the number of values you are using in your array, and one to indicate the current capacity of your array. When you run out of room, you allocate more space. For example, here is a poor man’s non-exception safe version of a vector:

int size = 0;
int capacity = 1;
int array = new int[capacity];

while (inputFile >> newValue)
{
    if (size == capacity)
    {
        capacity *= 2;
        int * newArray = new int[capacity];
        for (int i=0; i