The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
0 votes
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 with the note: Duplicate
asked in Algorithms by Veteran (17.5k points)
closed by | 170 views

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

29,017 questions
36,844 answers
34,721 users