Anon

Unregistered less info
31 reputation
1
bio website
location
age
visits member for 3 years
seen Jul 5 '11 at 20:26

Jul
5
comment How do I determine the runtime of a double recursive function?
@Mark Mann - and that contradicts what I said how?
Jul
5
comment How do I determine the runtime of a double recursive function?
You determine Big-O performance by taking the highest order of any called method and multiplying it by the order of the calling method. However, once you start talking about exponential and factorial performance, you can ignore polynomial performance. I believe that the same holds when comparing exponential and factorial: factorial wins. I've never had to analyze a system that was both exponential and factorial.
Jul
5
awarded  Teacher
Jul
5
answered How do I determine the runtime of a double recursive function?