Legendre prime counting function: Difference between revisions
Content added Content deleted
m (→{{header|Vlang}}: Fixed trivial cases n = 3 to 8 (see talk page).) |
m (→Iterative, partial sieving: Aligned with VLang.) |
||
| Line 3,537: | Line 3,537: | ||
var countPrimes = Fn.new { |n| |
var countPrimes = Fn.new { |n| |
||
if (n < |
if (n < 9) return (n < 2) ? 0 : ((n + 1)/2).floor |
||
var rtlmt = n.sqrt.floor |
var rtlmt = n.sqrt.floor |
||
var mxndx = Int.quo(rtlmt - 1, 2) |
var mxndx = Int.quo(rtlmt - 1, 2) |
||