DEL 1
a)
Code Block |
---|
function resboolean = isPalindrome ( str ) n = size (str , 2); resisPrime(N) boolean = true ; for i =1: n if str (i) ~= str (n+1-i) res = false ; break end end end |
b)
Code Block |
---|
function res = sequenceFinder (sequence,start,stop )
len = 0;
index = 0;
for i = 1:length(sequence)-length(stop)
if (length(start) <= length(sequence(i:end))) && strcmp(start,sequence(i:i+length(start)-1))
indexS = i;
elseif (length(stop) <= length(sequence(i:end))) && strcmp(stop,sequence(i:i+length(start)-1))
indexE = i;
if len < indexE -indexS
len = indexE -indexS;
index = indexS;
end
end
end
res = sequence(index:index+len+length(stop)-1);
end |
Eventuelt kan den lages litt enklere ved hjelp av matlabs strfind() funksjon.
DEL 2
a)
Code Block |
---|
function a = isDevisable(a,b)
a = ~mod(a,b);
end |
b)
Code Block |
---|
function res = prime(a) res = 1; for b = 2:a-1 if isDevisable(a,b)a = 1:2:ceil(sqrt(N)) if mod(N, a) == 0 resboolean = 0false; breakreturn; end end end function a = isDevisable(a,b) a = ~mod(a,b); end |
b)
104743.
c)
Code Block |
---|
function res = prime(a) res = 1; if isDevisable(a,2) res = 0; return; end for b = 1:2:ceil(sqrt(a)) if isDevisable(a,b) res = 0; break; end end end |
...