Domanda di colloquio di UBS
Few algorithms for computing efficiently the Fibonacci sequence
Risposta di colloquio
Anonimo
3 apr 2024
Naive (constant space, O(n) in time), or using efficient computation of power of any real number (O(log n) in time).
Few algorithms for computing efficiently the Fibonacci sequence
Anonimo
Naive (constant space, O(n) in time), or using efficient computation of power of any real number (O(log n) in time).