Classic - Fibonacci sequence

[Algorithms]

Fibonacci sequence .. you all know it, do it how ever you wish. My example in Python takes an argument and returns the result of the sequence up to that argument.

   snip

Edited by: Algorithms  at: 10/3/04 8:58 am

[WannaBe]

Quote:

---

you all know it

---

so...whats it doing?

---

www.000k.com/
WannaBe Games

[Algorithms]

If I would of posting the right code :) It sums the previous number using the result of the current sum. This is an example of a recursive sequence, obeying the simple rule that to calculate the next term one simply sums the preceding two...

OR

F(n) = F(n – 1) + F(n – 2)

0 + 1 = 1
1 + 1 = 2
2 + 1 = 3
3 + 2 = 5
5 + 3 = 8
8 + 5 = 13
...

  # generatordef fib():  cur = 0  nxt = 1  while 1:    cur, nxt = nxt, cur + nxt    yield curfibout = fib()for i in range(10):  sys.stdout.write("%s " % fibout.next())

Edited by: Algorithms  at: 10/3/04 8:59 am

[Algorithms]

Might as well do CPP also...

[Algorithms]

Output

 Python1 1 2 3 5 8 13 21 34 55 >>>C++wayne@dragon cpp $ ./fib1 1 2 3 5 8 13 21 34 55

[Algorithms]

And in case anyone is interested...

 wayne@dragon cpp $ time ./fib1 1 2 3 5 8 13 21 34 55real    0m0.006suser    0m0.010ssys     0m0.000swayne@dragon python $ time python fib.py1 1 2 3 5 8 13 21 34 55real    0m0.032suser    0m0.020ssys     0m0.010s

[Algorithms]

I will resist the temptation to post this in other languages... I feel so alone... lol

[Cerulean]

This took me a solid 10 minutes to figure out (didn't want to look at your code and cheat :-P), i've never come across this before...

java script:

  function genSequence(n) {        var previous = 0;        var current = 1;        var tmp;        for(i = 1; i <= n; i++) {                document.write((previous + current) + "<br />");                tmp = current;                current = current + previous;                previous = tmp;        }}genSequence(10);

PHP:

  function genSequence($n) {        $previous = 0;        $current = 1;        $tmp;        for($i = 1; $i <= $n; $i++) {                echo(($previous + $current)."<br />");                $tmp = $current;                $current = $current + $previous;                $previous = $tmp;        }}genSequence(10);

both print:

1
2
3
5
8
13
21
34
55
89

Edited by: Cerulean Wave at: 10/4/04 11:08 am

[Blankety Blank Man]

Java:

 public class Fib{    public static void main(String[] args)    {        int n1 = 1;        int n2 = 1;        System.out.println(1 + "\n" + 1);        do        {            n2 = n1 + n2;            System.out.println(n2);            for(double a = 0; a < 1000000; a += 0.01);        }        while(1==1);    }}

Not really all that hard, you just need to know what the Fibbonacci sequence is

[Algorithms]

Not really all that hard, you just need to know what the <insert any> is.. hehe

The great thing about the Fibonacci is when you first try it using Fib(n) = (Fibn-1) + Fib(n-2) the problem is very simple, but it is the temporary switching, that gets most people. Same with Linked Lists, the idea is very easy and one that is very simple to implement, but people have trouble with it until they see an example or finally it just clicks.

Sequences are weird like that.

[Eric]

www.programmers-corner.co...ib&=Search

It doesn't do the parameters thing... just the routine for the recursive calc... in VB6 and C/C++.

Eric D. Burdo - RLI Solutions

---

Sign Up Today for the Programmer's Corner Newsletter
the drop ship guide - The complete guide on to how to get started with wholesale drop shipping.

---