can you help me turn this algorithm to matlab and plotting the number of earring
1 次查看(过去 30 天)
显示 更早的评论
fonction pgd n:entier; var i debut i=2 tantque i≤n/2 et (n mod i)#0 faire i=i+1 fintantque si (n mod i)=0 alors pgd=n div i sinon pgd=n finsi fin
0 个评论
采纳的回答
Roger Stafford
2013-11-9
编辑:Roger Stafford
2013-11-9
It looks as though you want to find the largest divisor of n less than n if n is not a prime number, and otherwise the prime number n itself. You could perhaps make your code more efficient if you replaced "i≤n/2" with "i<=sqrt(n)".
I am not sure about the name of your function. I don't understand that request about "plotting the number of earring".
function pgd = entier(n)
i = 2;
while i≤n/2 & mod(n,i)~-0
i = i+1;
end
if mod(n,i)==0
pgd = n/i;
else
pgd = n;
end
end
更多回答(0 个)
另请参阅
类别
在 Help Center 和 File Exchange 中查找有关 String Data 的更多信息
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!