Hey guys this is the fibonacci series. But Im having this huge problem.
First of all I want to do the simplest code possible so then I can use
user defined functions and arrays. But this one didnt came out well.
Any suggestions!
#include<stdio.h>
#include<math.h>
int main ()
{
int fib, n;
for(n=0; n<=10; n++)
{
fib=(n-1)+(n-2);
printf("%d \n", fib);
}
return 0;
} 11 4159
Am Sun, 11 Dec 2005 07:06:00 -0800 schrieb MARQUITOS51: Hey guys this is the fibonacci series. But Im having this huge problem. First of all I want to do the simplest code possible so then I can use user defined functions and arrays. But this one didnt came out well. Any suggestions!
#include<stdio.h> #include<math.h>
int main ()
{ int fib, n;
for(n=0; n<=10; n++) {
fib=(n-1)+(n-2); printf("%d \n", fib);
}
return 0; }
As far as I remember, this isn't the fibonacci algorithm.
First it starts with 1 and 1, the third element of fibonacci series is the
addition of the first and second. So fib(n)=fib(n-1)+fib(n-2).
Not saving all elements you are able to only save the last elements in
variables and shift them. But what you did on the indexing element doesn't
make any sense.
Bye,
Stefan
Hey I did this a few moments ago and it workes. Can you check it and
suggest how to optimize. Im also looking how to convert it to user
defined function.
#include<stdio.h>
#include<math.h>
int main ()
{ int f[50];
int n=2;
f[0]=0;
f[1]=1;
do
{
f[n]=f[n-1]+f[n-2];
n++;
}
while(n<=49);
for(n=0; n<=49; n++)
{printf("%d \n", f[n]);}
return 0;
}
MARQUITOS51 <cr********@gmail.com> wrote: Hey I did this a few moments ago and it workes. Can you check it and suggest how to optimize. Im also looking how to convert it to user defined function.
Sure, it works, if you don't ever plan on wanting more than 50
Fibonacci numbers. malloc() and friends can help you store an
arbitrary number of Fibonacci numbers. If you're just trying to print
them, you don't need more than three distinct variables. Think about
it.
#include<stdio.h> #include<math.h>
Why are you including this header? You're not using anything from it.
int main ()
int main( void ) /* better */
--
Christopher Benson-Manica | I *should* know what I'm talking about - if I
ataru(at)cyberspace.org | don't, I need to know. Flames welcome.
MARQUITOS51 wrote: Hey guys this is the fibonacci series. But Im having this huge problem. First of all I want to do the simplest code possible so then I can use user defined functions and arrays. But this one didnt came out well. Any suggestions!
#include <stdio.h>
unsigned fib(unsigned n) {
return n <= 2 ? 1 : fib(n - 1) + fib(n - 2);
}
int main(void) { printf("fib(17) is: %d\n", fib(17)); return 0; }
P.Krumins
"Peteris Krumins" <pe*************@gmail.com> wrote in message
news:11*********************@f14g2000cwb.googlegro ups.com...
[snip] #include <stdio.h>
unsigned fib(unsigned n) { return n <= 2 ? 1 : fib(n - 1) + fib(n - 2);
Personally, I'd make that:
return n < 2 ? n : fib(n - 2) + fib(n - 1);
}
int main(void) { printf("fib(17) is: %d\n", fib(17)); return 0; }
Alex
Peteris Krumins wrote: MARQUITOS51 wrote:
Hey guys this is the fibonacci series. But Im having this huge problem. First of all I want to do the simplest code possible so then I can use user defined functions and arrays. But this one didnt came out well. Any suggestions!
#include <stdio.h>
unsigned fib(unsigned n) { return n <= 2 ? 1 : fib(n - 1) + fib(n - 2); }
int main(void) { printf("fib(17) is: %d\n", fib(17)); return 0; }
Somebody always proposes this solution, but it's a
poor one. Try it with fib(47), say, and tell us how
long it takes. Hint: You won't need a high-precision
timer.
--
Eric Sosman es*****@acm-dot-org.invalid
Eric Sosman wrote: Peteris Krumins wrote:
Somebody always proposes this solution, but it's a poor one. Try it with fib(47), say, and tell us how long it takes. Hint: You won't need a high-precision timer.
Yes, the solution has exponential complexity.
P.Krumins
In article <z7********************@comcast.com>, Eric Sosman <es*****@acm-dot-org.invalid> writes: Peteris Krumins wrote: #include <stdio.h>
unsigned fib(unsigned n) { return n <= 2 ? 1 : fib(n - 1) + fib(n - 2); }
int main(void) { printf("fib(17) is: %d\n", fib(17)); return 0; }
Somebody always proposes this solution, but it's a poor one. Try it with fib(47), say, and tell us how long it takes. Hint: You won't need a high-precision timer.
Well, there's always this one (with error checking left as an
exercise for the reader):
/***
prev2 and prev are the two immediately preceeding values in the
series; prev2 is F(n-2) and prev is F(n).
pos is the current position in the series.
want is the position we're looking for.
***/
unsigned fib_cps(unsigned prev2, unsigned prev, unsigned pos, unsigned want)
{
if (want <= 2) return 1;
if (pos == want) return prev2 + prev;
return fib_r(prev, prev2 + prev, pos + 1, want);
}
unsigned fib(n)
{
return fib_cps(1, 1, 3, n);
}
Even written this way, and compiled without optimization (I verified
that the compiler left the tail-recursive call in rather than
optimizing it to a branch), this computes fib(47) in negligible time.
But of course it's just the forward-iterative version written as tail
recursion.
It'd be possible to rewrite Peteris' backward-recursing algorithm
using continuation-passing style and tail recursion, but since C
lacks dynamic closures we'd have to emulate them. And that would
just involve recursively creating some sort of list of instructions
to run the forward-iterative algorithm, so it's not very interesting.
--
Michael Wojcik mi************@microfocus.com
Is it any wonder the world's gone insane, with information come to be
the only real medium of exchange? -- Thomas Pynchon
Peteris Krumins wrote: Eric Sosman wrote: Peteris Krumins wrote: Somebody always proposes this solution, but it's a poor one. Try it with fib(47), say, and tell us how long it takes. Hint: You won't need a high-precision timer.
Yes, the solution has exponential complexity.
Exercise to the reader: Describe a function to precisely count the
number of "+" operations performed by this function for computing f(n).
(Hint: its easier than you think.)
--
Paul Hsieh http://www.pobox.com/~qed/ http://bstring.sf.net/
On 2005-12-11, Peteris Krumins <pe*************@gmail.com> wrote: Eric Sosman wrote: Peteris Krumins wrote:
Somebody always proposes this solution, but it's a poor one. Try it with fib(47), say, and tell us how long it takes. Hint: You won't need a high-precision timer.
Yes, the solution has exponential complexity.
But only needs the last two results [or even the last one even and the
last one odd n] cached to reduce it to the same as the iterative
version. mw*****@newsguy.com (Michael Wojcik) writes: In article <z7********************@comcast.com>, Eric Sosman <es*****@acm-dot-org.invalid> writes: Peteris Krumins wrote: #include <stdio.h>
unsigned fib(unsigned n) { return n <= 2 ? 1 : fib(n - 1) + fib(n - 2); }
int main(void) { printf("fib(17) is: %d\n", fib(17)); return 0; }
Somebody always proposes this solution, but it's a poor one. Try it with fib(47), say, and tell us how long it takes. Hint: You won't need a high-precision timer.
Well, there's always this one (with error checking left as an exercise for the reader):
/*** prev2 and prev are the two immediately preceeding values in the series; prev2 is F(n-2) and prev is F(n). pos is the current position in the series. want is the position we're looking for. ***/
unsigned fib_cps(unsigned prev2, unsigned prev, unsigned pos, unsigned want) { if (want <= 2) return 1; if (pos == want) return prev2 + prev; return fib_r(prev, prev2 + prev, pos + 1, want); }
unsigned fib(n) { return fib_cps(1, 1, 3, n); }
(Of course you meant fib_cps rather than fib_r in the first function.)
Just for my own enjoyment:
unsigned
fib3( unsigned n, unsigned a, unsigned b ){
return n == 0 ? b : fib3( n-1, b, a+b );
}
unsigned
fib( unsigned n ){
return fib3( n, 1, 0 );
}
This definition yields fib(0) == 0, as the Fibonacci numbers are
usually defined. This thread has been closed and replies have been disabled. Please start a new discussion. Similar topics
by: dleecurt |
last post by:
Hello, I have a small problem, I am trying to write a program that
will calculate the Fibonacci number series, and I have the code
complete with one problem. I used a long in to store the numbers,...
|
by: Alex Vinokur |
last post by:
An algorithm which computes very long Fibonacci numbers
http://groups.google.com/groups?selm=bnni5p%2412i47o%241%40ID-79865.news.uni-berlin.de
was used as a performance testsuite
to compare speed...
|
by: Lance |
last post by:
What is the correct STL libraries to implement in order to have a Fibonacci
Heap created?
I am creating an algorithm which would use a Fibonacci Heap.
Thanks,
Lance
|
by: Niks |
last post by:
Can anybody explain me what is a "Fibonacci search"?
even an URL will do.
Thanks for reading.
|
by: YS Sze |
last post by:
If you know the exact longitude and latitude for a specific
location, would anyone think it'd make any sense to find out if this
set of location numbers is really part of the Fibonacci series or...
|
by: CII |
last post by:
Hi everybody. I've been reading posts a year old about the fibonacci
series right on this newsgroup, and while it's not directly games
related, I'll share my own notes as well.
On another...
|
by: felixnielsen |
last post by:
Im actually kinda embarassed to ask this question...
@code start
#include <iostream>
int main() {
unsigned long long a = 1;
unsigned long long b = 1;
for (int i = 0; i < 45; i++) {
a += b;...
|
by: greek |
last post by:
Hi!
I hav to generate fibonaaci series using recursion:
0,1,1,2,3,5,8,18,21...
whr
fibonacci(0)=0
fibonacci(1)=1
fibonacci(n)=fibonacci(n-1)+fibonacci(n-2)
ive witten the code but having 2...
|
by: veeru |
last post by:
Hi All,
Can anyone tell about how to create a FIBONACCI series in VB.Net and C#
Thanks in Advance,
Veeru
|
by: mac |
last post by:
Hi,
I'm trying to write a fibonacci recursive function that will return
the fibonacci string separated by comma. The problem sounds like this:
-------------
Write a recursive function that...
|
by: Charles Arthur |
last post by:
How do i turn on java script on a villaon, callus and itel keypad mobile phone
|
by: nemocccc |
last post by:
hello, everyone, I want to develop a software for my android phone for daily needs, any suggestions?
|
by: Hystou |
last post by:
There are some requirements for setting up RAID:
1. The motherboard and BIOS support RAID configuration.
2. The motherboard has 2 or more available SATA protocol SSD/HDD slots (including MSATA, M.2...
|
by: marktang |
last post by:
ONU (Optical Network Unit) is one of the key components for providing high-speed Internet services. Its primary function is to act as an endpoint device located at the user's premises. However,...
|
by: Oralloy |
last post by:
Hello folks,
I am unable to find appropriate documentation on the type promotion of bit-fields when using the generalised comparison operator "<=>".
The problem is that using the GNU compilers,...
|
by: jinu1996 |
last post by:
In today's digital age, having a compelling online presence is paramount for businesses aiming to thrive in a competitive landscape. At the heart of this digital strategy lies an intricately woven...
|
by: Hystou |
last post by:
Overview:
Windows 11 and 10 have less user interface control over operating system update behaviour than previous versions of Windows. In Windows 11 and 10, there is no way to turn off the Windows...
|
by: tracyyun |
last post by:
Dear forum friends,
With the development of smart home technology, a variety of wireless communication protocols have appeared on the market, such as Zigbee, Z-Wave, Wi-Fi, Bluetooth, etc. Each...
|
by: agi2029 |
last post by:
Let's talk about the concept of autonomous AI software engineers and no-code agents. These AIs are designed to manage the entire lifecycle of a software development project—planning, coding, testing,...
| |