Complexity Analysis

#1

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;
}

#2

the ccomplexity is O(Log min(a, b))

#3

Ans is given as log(n). Can you please explain?

#4

ha vahi ho gya na
O ( log(n) )

#5

Explain ekbaar how it is log(n)?

#6

2nd answer padho

#7

Thank you very much :’)

1 Like