Rosetta Code

Legendre prime counting function: Difference between revisions

← Older editNewer edit →
Content deleted Content added
Wherrera (talk | contribs)
4,111 edits
m add some compiler optimizations
PureFox (talk | contribs)
9,496 edits
m →‎{{header|Vlang}}: Fixed trivial cases n = 3 to 8 (see talk page).
Line 3,363:
[direct_array_access]
fn count_primes_to(n u64) i64 {
if n < u64(39) { return if n < i64(2) { i64(0) } else { i64((n + 1) / 2) } }
rtlmt := u64(sqrt(f64(n)))
mxndx := i64((rtlmt - 1) / 2)
Retrieved from "https://rosettacode.org/wiki/Legendre_prime_counting_function"