Name
  • Prime numbers
  • Prime factorization
Edit
Comparing to classic sieve of Eratosthenes this algorithm has complexity O(n). Moreover, it computes minimal prime factor for each number in [2..N], but uses more memory.


C# Other implementations: Python