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

-3 votes297 views2 answers
Virtual function in C++
C++
0 vote227 views1 answer
C++ code executio canntot proceed because glew32.dll was not founud
C++
0 vote253 views1 answer
C++ foreach
C++
1 vote269 views3 answers
For vector c++
C++
11 votes281 views2 answers
Convert decimal to binary c++
C++
2 votes262 views1 answer
2-Dimensional array in c++
C++
0 vote278 views1 answer
Google test assert exception
C++
1 vote257 views6 answers
Insertion sort
C++
0 vote251 views1 answer
Cstring to string
C++
0 vote260 views1 answer
Rgb(100,100,100,0.5) validation c++
C++