W_Heisenberg
Full Member level 4
- Joined
- Feb 27, 2011
- Messages
- 217
- Helped
- 6
- Reputation
- 12
- Reaction score
- 6
- Trophy points
- 1,298
- Location
- Boston
- Activity points
- 2,575
Hi, all
it is said that for euclidean algorithm,its asymptotically time comlexity equal to log 2/(sqrt(5)-1) n, which reads as logarithm n based on 2/(sqrt(5)-1), why is so?
*** please help me!
- - - Updated - - -
G O D is the above* * *....
why is this not shown?
it is said that for euclidean algorithm,its asymptotically time comlexity equal to log 2/(sqrt(5)-1) n, which reads as logarithm n based on 2/(sqrt(5)-1), why is so?
*** please help me!
- - - Updated - - -
G O D is the above* * *....
why is this not shown?
