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

35 votes299 views6 answers
Hello world cpp
C++
0 vote265 views1 answer
Thread group c++
C++
0 vote253 views1 answer
How to refresh multiple command lines in C++ stream
C++
0 vote290 views1 answer
Stl reverse sort a array
C++
1 vote329 views1 answer
C++ data structures
C++
0 vote254 views1 answer
C++ cout iostream
C++
3 votes271 views1 answer
Friend function in c++
C++
0 vote264 views1 answer
Currency Converter c++
C++
3 votes281 views4 answers
String c++
C++
0 vote275 views1 answer
Difference between --a and a-- c++
C++