Legendre prime counting function: Difference between revisions
Content added Content deleted
m (→Iterative, partial sieving: Aligned with VLang.) |
m (→{{header|C}}: Aligned with VLang.) |
||
Line 54: | Line 54: | ||
int64_t countPrimes(uint64_t n) { |
int64_t countPrimes(uint64_t n) { |
||
if (n < |
if (n < 9) return (n < 2) ? 0 : ((int64_t)n + 1) / 2; |
||
uint64_t rtlmt = (uint64_t)sqrt((double)n); |
uint64_t rtlmt = (uint64_t)sqrt((double)n); |
||
int64_t mxndx = (int64_t)((rtlmt - 1) / 2); |
int64_t mxndx = (int64_t)((rtlmt - 1) / 2); |