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 vote327 views1 answer
Ifstream file (“code2.txt”); dev C++
C++
0 vote326 views1 answer
C++ throw index out of bound
C++
0 vote328 views1 answer
Turbo c++ easy programs
C++
0 vote337 views1 answer
Find min and max in array c++
C++
0 vote336 views2 answers
Size of unordered_set
C++
0 vote354 views1 answer
Cpp tutorial
C++
0 vote321 views1 answer
Strcmp in c++ header file
C++
0 vote334 views1 answer
Cpp set time
C++
3 votes351 views4 answers
C++ get last character of string
C++
0 vote291 views1 answer
Two D Arrays
C++