.

Is this a iteration or recursion method of finding gcd?

Can you add in comments to the lines (labelled 1 to 2 and 3 to 9) so that i can understand what it is about?

1 def integerA(): 2 pass print( "Enter two numbers to find the GCD") a - int(input()) b - int(input()) 3 count0 4 while (not b) : If a > b: a -a b 7 else: 28 bb a count count 1 print (a)