/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 vote124 views1 answer
Height of bst cpp
C++
2 votes107 views2 answers
Decltype in c++
C++
0 vote105 views1 answer
KUNG FU HUSTLE
C++
1 vote117 views1 answer
Roscpp publish int32
C++
1 vote117 views1 answer
Iterate vector from end to begin
C++
102 votes175 views6 answers
Git config username and password
C++
0 vote127 views1 answer
Rectangle Area hackerrank in c++
C++
3 votes92 views3 answers
C vs c++ vs c#
C++
19 votes108 views3 answers
Segmentation fault (core dumped)
C++
0 vote106 views1 answer
C++ multiple if conditions
C++