Your fibonacci function runs in exponential time. Autocad 2003 Full Version With Crack. Let me put it this way: Suppose that it takes 1 microsecond to compute fib_num(0) and fib_num(1). Then, in computing fib_num(2), you'll call fib_num(0), which takes 1 microsecond (mms, I'll abbreviate), and fib_num(1), which also takes 1 mms. This means that fib_num(2) will take at least 2 mms. Then, to compute fib_num(3), you will call fib_num(2), which takes at least 2 mms, and then fib_num(1), which takes 1 mms. So fib_num(3) takes at least 3 mms. Continuing this pattern, fib_num(4) would take at least 5 mms, fib_num(5) would take 3 + 5 = 8 mms, and fib_num(6) would take 5 + 8 = 13 mms, at least.
This is actually the fibonacci pattern of growth in runtime. And the fibonacci pattern grows exponentially. Apc Rs 500 here. You'll find that for large values of n (like 100), the time it takes to compute f(n) is about 1.618 times the amount of time it takes to compute f(n - 1).