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

2 votes109 views1 answer
Qchar to char
C++
0 vote120 views1 answer
Macro c++
C++
0 vote119 views1 answer
Arduino C++ servomotor random moving
C++
0 vote77 views1 answer
Sort deque in c++
C++
0 vote114 views1 answer
Graph using queue c++
C++
0 vote124 views1 answer
If not c++
C++
0 vote131 views2 answers
C++ typeid
C++
1 vote132 views1 answer
Float in c++
C++
0 vote128 views1 answer
Spicoli
C++
0 vote172 views1 answer
Get rest of a stringstream c++
C++