The complexity is of recursive implementation of fibonacci is O(golden ratio ^ n). If it was O(n ^ 2) it would run under 0.1s. By the way, the nimpy looks cool

The complexity is of recursive implementation of fibonacci is O(golden ratio ^ n). If it was O(n ^ 2) it would run under 0.1s. By the way, the nimpy looks cool. Thanks for sharing.