Prime number generator c++

#include <vector>
int main()
{
    std::vector<int> primes;
    primes.push_back(2);
    for(int i=3; i < 100; i++)
    {
        bool prime=true;
        for(int j=0;j<primes.size() && primes[j]*primes[j] <= i;j++)
        {
            if(i % primes[j] == 0)
            {
                prime=false;
                break;
            }
        }
        if(prime) 
        {
            primes.push_back(i);
            cout << i << " ";
        }
    }

    return 0;
}

Source: stackoverflow.com

Similar codes

2 votes219 views1 answer
++x vs x++
C++
0 vote195 views1 answer
C++ define array with values
C++
0 vote200 views1 answer
How to do if command in c++
C++
0 vote217 views1 answer
How to make a pointer point to a the last value in an array
C++
0 vote202 views1 answer
What is require to run min max function on linux in cpp
C++
4 votes211 views3 answers
GCD in cpp
C++
0 vote207 views1 answer
Ue4 endoverlap c++
C++
0 vote200 views1 answer
Convert c program to c ++ online
C++
32 votes214 views2 answers
How to sort a vector in reverse c++
C++
1 vote217 views1 answer
Get an array with c++
C++