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 vote297 views1 answer
How to check sqrt of number is integer c++
C++
0 vote245 views2 answers
Print all number between a and b in c++
C++
2 votes271 views2 answers
Sieve of eratosthenes c++
C++
0 vote207 views1 answer
Electricity billing system project in c++
C++
0 vote241 views1 answer
C++ list of pairs
C++
1 vote239 views1 answer
Union cpp
C++
1 vote270 views1 answer
Shout sharkest
C++
-1 vote212 views1 answer
C++ to mips assembly converter
C++
0 vote267 views1 answer
What does npl mean?
C++
0 vote257 views1 answer
How to add external library in clion
C++