You are viewing a single comment's thread. Return to all comments →
When you say O(N*V) does V represent the overhead of storing/manipulating very large numbers?
If yes, then I don't think it's useful for analysing runtime behaviour for this exercise because:
1) It's uses python's builtin handling of numbers.
2) Every other solution will have the same overhead and so I think can be treated as a constant factor.
I'm very interested to learn what is faster for large Vs?
I like goodengineer's analysis to get O(log n) - which is equivalent (I think) to the SICP 1.19 exercise on fibonacci numbers
If no, then what does V represent?
Seems like cookies are disabled on this browser, please enable them to open this website
Recursion: Davis' Staircase
You are viewing a single comment's thread. Return to all comments →
When you say O(N*V) does V represent the overhead of storing/manipulating very large numbers?
If yes, then I don't think it's useful for analysing runtime behaviour for this exercise because:
1) It's uses python's builtin handling of numbers.
2) Every other solution will have the same overhead and so I think can be treated as a constant factor.
I'm very interested to learn what is faster for large Vs?
I like goodengineer's analysis to get O(log n) - which is equivalent (I think) to the SICP 1.19 exercise on fibonacci numbers
If no, then what does V represent?