/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 vote198 views1 answer
Columntransformer onehotencoder
C++
0 vote150 views1 answer
C++ load file as vector
C++
0 vote130 views1 answer
Cyclic array rotation in cpp
C++
5 votes171 views3 answers
Fast io c++
C++
0 vote135 views1 answer
Header for INT_MIN
C++
5 votes126 views3 answers
Pneumonia
C++
0 vote128 views1 answer
Dynamic memory in c++
C++
1 vote132 views3 answers
C++ map loop through key value
C++
0 vote146 views2 answers
Or in c++
C++
0 vote135 views1 answer
Set the jth bit from 1 to 0
C++