Report Bug

QusWhich loop condition is used in the algorithm to find the GCD of two numbers using Euclid's method? QusEuclid's method से GCD निकालने वाले algorithm में कौन-सी loop condition उपयोग होती है?

A. a > b
B. b == 0
C. while (b != 0)
D. a == b

Solution

C. while (b != 0)

Explanation

Euclid's algorithm repeatedly computes the remainder until b becomes zero.

Euclid's algorithm में remainder तब तक निकाला जाता है जब तक b zero नहीं हो जाता।