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 ...