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 vote108 views1 answer
What algorithm does bitcoin use
C++
0 vote122 views1 answer
#include <iostream> using namespace std; int main(){ int sum1 = 100+50; int sum2 = sum1+250; int sum3 = sum2+sum2; cout<< sum1 << "\n"; cout<< sum2 << "\n"; cout<< sum3 << "\n";
C++
12 votes115 views3 answers
Max element in array c++ stl
C++
0 vote118 views1 answer
C++ text between substrings
C++
0 vote116 views3 answers
C++ splitstring example
C++
1 vote122 views1 answer
Compile multiple files C++ linux
C++
2 votes138 views2 answers
Cannot open include file:
C++
2 votes117 views3 answers
How to find length of character array in c++
C++
4 votes111 views3 answers
Fork c
C++
0 vote126 views1 answer
Fabs c c++
C++