Question

How to calculate big omega for naive fibonacci sequence:

Fibonacci(n)
{n>=0}
if n<=1 then return (n);
else
a := Fibonacci(n - 2);
b := Fibonacci(n - 1);
return (a + b)
endif

Answer 1

what's that .... recursive algorithm?? anyway this should go to computer section