Skip to main content
Code Review

Return to Answer

deleted 3 characters in body
Source Link
Billal BEGUERADJ
Billal BEGUERADJ
  • 1
  • 10
  • 25
  • 35

@Peilonrayz hit the point by mentioning the real problem with your your your implementation design which is the algorithm complexity. So I want to go further: AFAIK, the fastest known algorithm that prime numbers generator isalgorithm is Sieve of Atkin. YouSo you should consider this algorithm as a starting point for an effective solution for the sake of algorithm complexity.

@Peilonrayz hit the point by mentioning the real problem with your your implementation design which is the algorithm complexity. So I want to go further: AFAIK, the fastest known algorithm that prime numbers generator is Sieve of Atkin. You should consider this algorithm as a starting point for an effective solution for the sake of algorithm complexity.

@Peilonrayz hit the point by mentioning the real problem with your implementation design which is the algorithm complexity. So I want to go further: AFAIK, the fastest known prime numbers generator algorithm is Sieve of Atkin. So you should consider this algorithm as a starting point for an effective solution for the sake of algorithm complexity.

Source Link
Billal BEGUERADJ
Billal BEGUERADJ
  • 1
  • 10
  • 25
  • 35

@Peilonrayz hit the point by mentioning the real problem with your your implementation design which is the algorithm complexity. So I want to go further: AFAIK, the fastest known algorithm that prime numbers generator is Sieve of Atkin. You should consider this algorithm as a starting point for an effective solution for the sake of algorithm complexity.