I have been asked by my tutor to code this pseudocode that outputs all of the intermediate as well as the final values of a Greatest Common Divisor. The inputs a and b are nonnegative numbers.
then return a
else return EUCID(b, a mod b)
I am at a loss and would be grateful if anyone can help me.