cython

1
def primes(int nb_primes):
2
    cdef int n, i, len_p
3
    cdef int[1000] p
4

5
    if nb_primes > 1000:
6
        nb_primes = 1000
7

8

9

10

11
    len_p = 0  # The current number of elements in p.
12
    n = 2
13
    while len_p < nb_primes:
14
        # Is n prime?
15
        for i in p[:len_p]:
16
            if n % i == 0:
17
                break
18

19
        # If no break occurred in the loop, we have a prime.
20
        else:
21
            p[len_p] = n
22
            len_p += 1
23
        n += 1
24

25
    # Let's copy the result into a Python list:
26
    result_as_list = [prime for prime in p[:len_p]]
27
    return result_as_list
28