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

3 votes289 views2 answers
C++ vector extend vector
C++
0 vote337 views1 answer
Through map c++
C++
20 votes302 views2 answers
Find height of a tree
C++
1 vote294 views1 answer
How to run a c++ program in the background
C++
0 vote315 views6 answers
Python converter to c
C++
26 votes309 views10 answers
Snake
C++
2 votes306 views1 answer
How to hide ui elements unity
C++
1 vote312 views1 answer
C++ find in pair
C++
0 vote339 views1 answer
C++ double is nan
C++
0 vote399 views1 answer
Time_t c++ stack overflow
C++