closed by
701 views
0 votes
0 votes
closed with the note: Duplicate https://gateoverflow.in/92487/series-repost-gateoverflow-algorithms-euclids-algorithm#c92690
What is the best case and worst case time complexity for Euclid's algorithm?Let numbers be a and b

As per my understanding

Best case - If a and b are multiple :0(1).

Worst case - Both are consecutive fibonicci number.Complexity?
closed by

Related questions

5 votes
5 votes
1 answer
1
rahul sharma 5 asked Dec 14, 2016
1,036 views
Reposting the previous post as I faced same questions during test series.Not able to find exact answer on google.I will close previous post.
2 votes
2 votes
1 answer
2
5 votes
5 votes
2 answers
3
Shivani gaikawad asked Aug 17, 2018
1,013 views
What is the space complexity of the following code?$O(logn)$ $O(n)$$O(nlogn)$ $O(1)$