Question: unsigned int gcd(unsigned int n, unsigned int m) { if (n == 0) return m; if (m == 0) return n; while (m! = n)

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?

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!