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 vote215 views1 answer
C ++ split_string
C++
0 vote204 views4 answers
How to make a square root function in c++ without stl
C++
2 votes189 views1 answer
Multiline comment in C++
C++
-2 votes233 views1 answer
Sum array c++
C++
0 vote186 views1 answer
C++ sort numbers by magnitude/absolute value
C++
0 vote194 views1 answer
Find the max element along with it's index in c++
C++
0 vote201 views1 answer
Pimpl c++
C++
0 vote220 views2 answers
What is ++i and i++
C++
0 vote206 views1 answer
C++ initialize size of 3d vector
C++
0 vote183 views1 answer
Generate random ints and floats
C++