Re: Re:calculating fibonacci[was: encryption]
- From: "Bill Cunningham" <nospam@xxxxxxxxxxxxx>
- Date: Sat, 13 Dec 2008 14:19:49 -0500
Osmium said:
[snip]
int fib(int n)
{
if(n==0)
return 0;
else if(n==1)
return 1;
else
return fib(n-1) + fib(n-2);
}
[snip]
Recursion! This is a good example right?
Bill
.
- Follow-Ups:
- Re: calculating fibonacci[was: encryption]
- From: Patricia Shanahan
- Re: calculating fibonacci[was: encryption]
- References:
- encryption
- From: Bill Cunningham
- Re:calculating fibonacci[was: encryption]
- From: Bill Cunningham
- Re: Re:calculating fibonacci[was: encryption]
- From: Bill Cunningham
- Re: Re:calculating fibonacci[was: encryption]
- From: Richard Heathfield
- encryption
- Prev by Date: Re: Re:calculating fibonacci[was: encryption]
- Next by Date: Re: Re:calculating fibonacci[was: encryption]
- Previous by thread: Re: calculating fibonacci[was: encryption]
- Next by thread: Re: calculating fibonacci[was: encryption]
- Index(es):
Relevant Pages
|
