/C++/11

11

println(getPrimes(10, 100));

function getPrimes(nPrimes, startAt)
{
    var ar = [];
    
    var i = startAt;
    
    while(ar.length < nPrimes)
    {
        if (isPrime(i))
        {
            ar.push(i);
        }
        
        i++;
    }
    
    return ar;
}

// Returns true if a number is prime
function isPrime(n)
{
    if (n < 2)
        return false;
        
    if (n == 2)
        return true;
    
    var maxDiv = Math.sqrt(n);
    
    for(var i = 2; i <= maxDiv; i++)
    {
        if (n % i == 0)
        {
            return false;
        }
    }
    
    return true;
}

Source: hackernoon.com

11

include

11

cout<<"display";

Source: portal.ucp.edu.pk

Similar codes

1 vote182 views1 answer
Terminal compile c++
C++
0 vote200 views1 answer
How to add an element to std::map
C++
1 vote161 views1 answer
G++ compile c++11
C++
2 votes174 views5 answers
How to sort a vector
C++
0 vote194 views1 answer
Iteraate through a vector
C++
15 votes154 views4 answers
2d vector
C++
0 vote184 views1 answer
How to use custom array in c++
C++
1 vote164 views1 answer
Even and odd in c++
C++
1 vote173 views3 answers
If c++
C++
6 votes178 views1 answer
C++ replace character in string
C++