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 vote197 views1 answer
Cpp create lambda with recursion
C++
0 vote193 views1 answer
All in one c++
C++
0 vote159 views1 answer
How to allocate memory for vector c++
C++
0 vote188 views1 answer
C++c
C++
0 vote174 views1 answer
Sum of first 100 natural numbers
C++
0 vote173 views1 answer
C++ std map initializer list
C++
1 vote195 views1 answer
Qt qchar to lower
C++
30 votes127 views10 answers
While loop c++
C++
0 vote179 views1 answer
How to make calculaor in c++
C++
0 vote217 views1 answer
Vs Code cpp not run
C++