Generates a complete list of primes P s.t. for all p in P, p < N. complexity: O(N**2).

Primes.py

# python 3.6.5
# from typing import List
def Primes( N: int ) -> List[int]:
	""" Generates a complete list of primes P s.t. for all p in P, p < N. """
	P: List[int] = []
	A: List[int] = [ n+1 for n in range( N ) ]
	for n in range( 1, N+1 ):
		if A[n-1] == 1:
			continue
		P.append( A[n-1] )
		for m in range( n, N+1, n ):
			A[m-1] = 1
	return P