is there anything we must take care of before executing Euclid’s algorithm like in GCD(a, b) a should be greater than b.
Are there any limitation to GCD or Euclid's algorithm?
@Ojhajogeshkumar No. The recursion will itself handle. Dry run for different possibilities like when a>b and when b>a and you will get it.