Question

write an algorithm to find the greatest common divisor .​

Answer 1

Answer:

Recall that the Greatest Common Divisor (GCD) of two integers A and B is the largest integer that divides both A and B. The Euclidean Algorithm is a technique for quickly finding the GCD of two integers.

ᑭᒪᘔ ᗰᗩᖇK Tᕼᗴ ᗩᑎՏ ᗩՏ ᗷᖇIᒪᒪIᗩᑎT.

Answer 2

Answer:

The Euclid algorithm ( for find greatest common divisor)