Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

Why k > 2? k > 1 is bad enough. Otherwise, recursive fib(n) would be just fine (O(~1.618^n)).


Because 1.00000000000001 ^ N is not bad for most values of N that you will actually use.




Consider applying for YC's Winter 2026 batch! Applications are open till Nov 10

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: