News for hackers. Stuff that matters.

A comment on Speeding up Python with Nim.

Re:Speeding up Python with Nim by matusf on Tuesday January 22, 2019 @06:31PM (#18973923)
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.

[ Parent | on HN ]

There are no comments on this comment yet.