Hi, That is also a very nice implementation if you don't want to keep a list of the whole sequence. Going forward in the discussion, we can actually avoid using deque and increase the speed almost by two.
deque
def padovan_j(): last = 1 prev1 = 1 prev2 = 1 prev3 = 1 while True: yield prev3 last = prev2 + prev3 prev1, prev2, prev3 = last, prev1, prev2
Are you sure you want to hide this comment? It will become hidden in your post, but will still be visible via the comment's permalink.
Hide child comments as well
Confirm
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
Hi,
That is also a very nice implementation if you don't want to keep a list of the whole sequence. Going forward in the discussion, we can actually avoid using
dequeand increase the speed almost by two.