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

algorithm pgdA
n:entier
i:entier
tantque n mod i #0 faire i=i-1fintantque
pgdA=i

[Image Analyst]

I doubt it. It looks like gibberish to me.

[Walter Roberson]

This appears to be exactly the same as the question that was previously Closed for you.

[Walter Roberson]

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

Answer 1

[Walter Roberson]

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.