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

I think it's the O(log n) algorithm that uses matrix exponentiation to find out the n'th Fibonacci number.


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

Search: