Info

此问题已关闭。 请重新打开它进行编辑或回答。

can you help me to turn this algorithm to matlab and plotting

1 次查看(过去 30 天)
algorithm pgdA
n:entier
i:entier
tantque n mod i #0 faire i=i-1fintantque
pgdA=i
  3 个评论
Walter Roberson
Walter Roberson 2013-11-7
This appears to be exactly the same as the question that was previously Closed for you.
Walter Roberson
Walter Roberson 2013-11-7
Google translate hints this would be:
algorithm PGDA
n: integer
i: integer
WHILE n mod i != 0 do i = i-1 END WHILE
PGDA = i

回答(1 个)

Walter Roberson
Walter Roberson 2013-11-7
If the algorithm is intended to find the largest integer "i" such that "i" is a factor of n, then
function i = pdga(n)
factors = factor(n);
if length(factors) == 1
i = 1;
else
i = prod(factors(2:end));
end
end
However, your tags suggest that you might be trying to generate code for an FPGA. If so then your algorithm would need to be different, especially considering that FPGA often do not support division. In such a case it would probably be useful to have an upper bound on "n" ahead of time.

此问题已关闭。

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by