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

0 vote175 views1 answer
Result += a +b in c++ meaning
C++
0 vote151 views1 answer
Flag controlled while loop c++
C++
0 vote202 views2 answers
Size of unordered_set
C++
0 vote218 views1 answer
Targon lol
C++
0 vote174 views1 answer
Ampersand in cpp
C++
-1 vote204 views6 answers
C to c++ converter online
C++
-1 vote171 views5 answers
C++ string split
C++
0 vote162 views2 answers
How to compile with libstdc++ fedora
C++
0 vote159 views1 answer
How to turn an integer variable into a char c++
C++
0 vote175 views1 answer
Math in section title latex
C++