Hi,

Just had a quick question about the runtime of the algorithm below: for i in range(1, a + 1): for j in range(1, b + 1): if i == j and a%i ==0 and b%j == 0: print(i, " is one of the common divisors of ", a , " and ", b)

The runtime on this would just be O(a+1 * b+1), which I believe comes out to O(n^2), correct? What would be one of the ways to improve on the runtime of this algorithm, and what would its runtime be? Thank you!