Legendre prime counting function: Difference between revisions
m
→{{header|Vlang}}: Fixed trivial cases n = 3 to 8 (see talk page).
m (add some compiler optimizations) |
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(
rtlmt := u64(sqrt(f64(n)))
mxndx := i64((rtlmt - 1) / 2)
| |||