/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

0 vote235 views1 answer
& in xml
C++
0 vote158 views1 answer
Sinh to hop c++
C++
0 vote132 views1 answer
Traverse string in cpp
C++
0 vote157 views1 answer
Basic stack implementation in c++
C++
0 vote154 views1 answer
C++ cout update percentage
C++
1 vote161 views1 answer
C++ random number 0 to 1
C++
0 vote161 views1 answer
C++ require keyword
C++
0 vote131 views1 answer
C++ descending sort
C++
0 vote107 views1 answer
How to get euler constant in c++
C++
0 vote134 views1 answer
C++ start thread later
C++