{"repository":{"description":"This project written in C++ compares different approaches to print nth number in Fibonacci sequence Approaches include 1) Classic recursive solution 2) Iterative solution with memoization 3) Matrix multiplication 4) Direct computation using Binet's formula 5) Template metaprogramming 6) Generator with getnext() and reset() member functions","watchers":0,"stargazers":0,"forks":0,"fork":false,"size":46,"owner":"wangchunjing","private":false,"open_issues":0,"has_issues":true,"has_downloads":true,"has_wiki":true,"created_at":"2013-08-11T20:11:47-07:00","pushed_at":"2013-08-11T20:32:37-07:00","master_branch":"master"},"actor_attributes":{"type":"User","email":"da39a3ee5e6b4b0d3255bfef95601890afd80709"},"url":"https://github.com/wangchunjing/fibsequence/compare/master"}