Feeds
已回答
Writing a function to find prime numbers
function y = isPrime(N) for i=2: floor(N/2) if mod(N,i)==0 y=false; return end y= true; end
Writing a function to find prime numbers
function y = isPrime(N) for i=2: floor(N/2) if mod(N,i)==0 y=false; return end y= true; end
4 years 前 | 0
