In the following C++ function, let n >= m.

    int gcd(int n, int m) {
            if (n%m ==0) return m;
            if (n < m) swap(n, m);
            while (m > 0) {
                n = n%m;
                swap(n, m);
            return n;

What is the time complexity of the above function assuming n > m?

Sign Up
to access hints and editorial solutions for GCD_CMPL
Click here to start solving coding interview questions