Question

I am creating a prime generator in c++ using an array to store primes as I find them and then use them to check against potentials later. Is there a way to “grow” my array as my program continues?

Answer 1

I would use a std:vector something like this:

vector<int> primes;

then you would add primes to it by using:

primes.push_back(2);

and retrieve values from the vector by using:

primes[0];

Good luck!