I don't know if its right, but I am getting the answer I wanted but now I don't know if I am doing the problem right, can someone tell me please?
This is the exercise:
1 2 3 4 5 6 7
"For experts: Revise the gcf function so that it uses
an iterative (loop- based) approach.
Each cycle through the loop should stop if B is zero;
otherwise, it should set new values for A and B and then continue.
You’ll need a temporary variable—temp—
to hold the old value of B for a couple of lines:
temp=b, b=a%b, and a=temp."
No. If a function calls itself directly or indirectly, that is recursive. If funcA calls funcB which doesn't, in turn, call funcA either directly or indirectly, then that is not recursive.