O(2^n)
On Sat, Jan 22, 2011 at 8:58 PM, Decipher <[email protected]> wrote:
> fun(n)
> {
> if(n<=2)
> return (1);
> else
> return ((fun(n-1)*fun(n-2));
> }
>
> find the order of complexity .
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to [email protected].
> To unsubscribe from this group, send email to
> [email protected]<algogeeks%[email protected]>
> .
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
