recursion.gd 371 B

12345678910111213141516171819
  1. func is_prime(number: int, divisor: int = 2) -> bool:
  2. print(divisor)
  3. if number <= 2:
  4. return (number == 2)
  5. elif number % divisor == 0:
  6. return false
  7. elif divisor * divisor > number:
  8. return true
  9. return is_prime(number, divisor + 1)
  10. func test():
  11. # Not a prime number.
  12. print(is_prime(989))
  13. print()
  14. # Largest prime number below 10000.
  15. print(is_prime(9973))