Prime Numbers with GDScript

prime-numbers.gd

extends Node2D

export var nmax = 300

func _ready():
	# Find prime numbers
	sieve_of_eratosthenes(nmax)


func sieve_of_eratosthenes(n: int):
	var nums = range(n + 1)
	for i in range(2, sqrt(n) + 1):
		var j = i * i
		while j <= n:
			nums[j] = 0
			j += i
	
	var primes: Array
	for p in nums:
		if p > 1:
			primes.append(p)
	print(primes)