Write pseudo code for printing out the first 100 prime numbers

Question

Basic Python Implementation (reads like pseudocode) · Accepted Answer

# works for generating 2 or more primes
def nPrimes(n):
    foundPrimes = [2, 3]
    
    # prime numbers are of the form 6k+1 and 6k-1
    toggle_2_4 = 2
    numToCheck = 5
    failed = False
    
    while(len(foundPrimes) < n):
    
        for prime in foundPrimes:
            if numToCheck % prime == 0:
                failed = True
                break
                
        if not failed:
            foundPrimes.append(numToCheck)
        failed = False
        
        numToCheck += toggle_2_4
        toggle_2_4 = 6 - toggle_2_4
    
    return foundPrimes

# print out 100 primes    
print nPrimes(100)

Fast Enterprises

Pergunta de entrevista da empresa Fast Enterprises

Resposta da entrevista

Empresas seguidas

Buscas de vagas