/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 vote131 views7 answers
Online compiler to calculator time complexity
C++
0 vote119 views1 answer
Cicli informatica c++
C++
0 vote161 views1 answer
Armstrong number in cpp
C++
0 vote136 views1 answer
Find min and max in array c++
C++
0 vote126 views1 answer
What type is this c++
C++
0 vote130 views2 answers
String to wstring conversion c++
C++
28 votes129 views4 answers
C++ vector remove element by value
C++
1 vote120 views1 answer
Pass c++
C++
102 votes270 views6 answers
Convert integer to string in c++
C++
3 votes131 views1 answer
C++ initialize array with all zeros
C++