Which algorithm is used to find GCD efficiently?

Question

Accepted Answer

(B) Euclidean Algorithm. Explanation: The Euclidean Algorithm computes GCD via repeated division: gcd(a,b) = gcd(b, a mod b).