#1
15.04.2021 um 17:27 Uhr
static bool[] Primes_Until(int n) { bool[] b = new bool[n + 1]; for (var i = 4; i <= n; i += 2) b[i] = true; for (var i = 3; i <= n; i += 2) if (!b[i]) for (var j = i + i; j <= n; j += i) b[j] = true; return b; }
Das Boolean-Array ist eine super Lösung!
