Discussion Forum Latest Questions

Piyush365

We can terminate immediately upon finding the very first common divisor. Since we count down from min(m, n), that first common factor is guaranteed to be the greatest common divisor without further scanning. Class 9 Chapter 11 The World of Algorithms ...

Kriti

The algorithm handles this partially or ambiguously because Step 3 explicitly specifies adding “the two digits.” It lacks instructions for processing the remaining leftmost columns where the 3-digit number has no digits left. Cbse Class 9 Maths Ganita Manjari Part 2 ...