Home/ Questions/Q 550625
Next
Piyush365
  • 0
Asked: 2026-10-01T04:57:31+00:00 In:

What about the last algorithm described above? What happens when we look at common divisors starting from min(m, n) and work backwards to 1?

  • 0

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 solutions
Class 9 Maths Ganita Manjari Part 2 Book and Solutions

cbse released class 9 ganita manjari part 2 bookganita manjari part 2 solutions available!happens when we look at common divisorslast algorithm described abovethe world of algorithms (ganita manjari 2) solutions
Share
    Leave an answer

    Leave an answer

    Browse