Generates the first N primes starting with 2. complexity: O(N**2).

PrimesGen.py

# python 3.6.5
# from typing import List
def PrimesGen( N: int ) -> List[int]:
	""" Generates the first N primes starting with 2. """
	P: List[int] = []
	i: int = 2
	while len(P) < N:
		is_prime: boolean = True
		for p in P:
			if i % p == 0:
				is_prime = False
				break
		if is_prime:
			P.append(i)
		i += 1
	return P