Question

programs to find gcd of two integers with non recursion in python​

Answer 1

Answer:

One way to find the GCD of two numbers is Euclid's algorithm, which is based on the observation that if r is the remainder when a is divided by b , then gcd(a, b) = gcd(b, r) . As a base case, we can use gcd(a, 0) = a . Write a function called gcd that takes parameters a and b and returns their greatest common divisor.

Explanation:

ya raha answer

Answer 2

Answer:

I don't no but Mark me as a brainlist