///Geoff Hagopian
///checking
/**
PPP4#11. Create a program to find all the prime numbers
between 1 and 100. One way to do this is to write a function
that will check if a number is prime (i.e., see if the number
can be divided by a prime number smaller than itself) using a
vector of primes in order (so that if the vector is called
primes, primes[0]==2, primes[1]==3, primes[2]==5, etc.).
Then write a loop that goes from 1 to 100, checks each number
to see if it is a prime, and stores each prime found in a
vector. Write another loop that lists the primes you found.
You might check your result by comparing your vector of
prime numbers with primes. Consider 2 the first prime.
**/
#include "std_lib_facilities.h"
//#include <cstdlib>
//#include <ctime>

void listPrimes(vector<unsigned> p) {
    for(int i = 0; i < p.size(); ++i)
        cout << p[i] << " ";
}

int main() {
    vector<unsigned> primes;
    //primes.push_back(2);
    bool isPrime{true};
    for(int i = 2; i <= 100; i++) {
        isPrime=true;
        for(int j = 0; j < primes.size(); j++)
            if(i%primes[j]==0)
                isPrime =false;
        if(isPrime) primes.push_back(i);
    }
    listPrimes(primes);
}