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 vote275 views1 answer
Bash test empty directory
C++
1 vote285 views1 answer
Preorder
C++
2 votes306 views1 answer
Null c++
C++
1 vote257 views1 answer
Prime numbers less than a given number c++
C++
6 votes281 views4 answers
Int to qstring
C++
2 votes264 views2 answers
How to get cursor position c++
C++
0 vote249 views1 answer
Check if a variable is tring c++
C++
1 vote308 views1 answer
Priority queue ordered by second element
C++
1 vote249 views1 answer
Convert whole string to lowercase c++
C++
1 vote260 views1 answer
Do while loop c++ loops continuously
C++