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

1 vote299 views1 answer
Operator overloading
C++
4 votes356 views1 answer
C++ measure time
C++
1 vote298 views1 answer
While until c++
C++
0 vote314 views1 answer
How to adjust and delete memory in c, c++
C++
0 vote318 views1 answer
C++ excel cell blank cells
C++
2 votes352 views1 answer
How to make crypto
C++
0 vote304 views1 answer
Surf interpolation matlab
C++
0 vote305 views1 answer
C++ read_ascii
C++
0 vote331 views1 answer
Cpp fread
C++
1 vote319 views1 answer
STD::ERASE FUNCTION IN C++
C++