This is the best algorithm I could come up. def get_primes(n): numbers = set(range(n, 1, -1)) primes = while numbers: p = numbers.pop() primes.append(p) numbers.difference_update(set(range(p*2, n+1, p))) return...
  • May 9, 2022
  • 0 Comments