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 vote276 views1 answer
How to sort array in c++ stockoverflow
C++
0 vote255 views1 answer
Cicli informatica c++
C++
1 vote243 views1 answer
Arduino funktion
C++
0 vote289 views1 answer
Wap in c++ to understand function template
C++
2 votes284 views2 answers
Hide terminal window c++
C++
1 vote271 views1 answer
How to get 4 decimal places in c++
C++
1 vote267 views1 answer
C++ keyboard input
C++
2 votes261 views2 answers
C++ check palindrome
C++
0 vote276 views1 answer
Unordered map c++
C++
8 votes267 views1 answer
Arduino for command
C++