...
Code Block | ||
---|---|---|
| ||
function booleanresult = isPrime(N) booleanresult = true; if N <= 3 booleanresult = falsetrue; endelse for a = 3:2:ceil(sqrt(N)-1) if mod(N, a) == 0 booleanresult = false; return; end end end end |
b)
Code Block | ||
---|---|---|
| ||
function primeList = getPrimeList(N) primeList = zeros(1, N); % preallokerer primeList(1) = 2; pos = 1; numberToCheck = 3; while primeList(end) == 0 isPrime = true; for i = 1 : pos if mod(numberToCheck, primeList(i)) == 0 isPrime = false; break end if ceil(sqrt(numberToCheck)) < primeList(i) break end end if isPrime pos = pos + 1; primeList(pos) = numberToCheck; end numberToCheck = numberToCheck + 2; end end |
...