unsigned int gcd(unsigned int n, unsigned int m) { if (n == 0) return m; if (m == 0) return n; while (m! = n) { if (n>m) n = nm; else m = mn; } return n; }

What is the run time of this algorithm as tight as possible?