It looks like you're new here. If you want to get involved, click one of these buttons!

- 140.5K All Categories
- 104.3K Programming Languages
- 6.4K Assembler Developer
- 1.8K Basic
- 39.7K C and C++
- 4.2K C#
- 7.9K Delphi and Kylix
- 4 Haskell
- 9.6K Java
- 4.1K Pascal
- 1.3K Perl
- 1.9K PHP
- 505 Python
- 48 Ruby
- 4.3K VB.NET
- 1.6K VBA
- 20.8K Visual Basic
- 2.6K Game programming
- 309 Console programming
- 88 DirectX Game dev
- 1 Minecraft
- 108 Newbie Game Programmers
- 2 Oculus Rift
- 8.9K Applications
- 1.8K Computer Graphics
- 726 Computer Hardware
- 3.4K Database & SQL
- 520 Electronics development
- 1.6K Matlab
- 627 Sound & Music
- 254 XML Development
- 3.3K Classifieds
- 189 Co-operative Projects
- 175 For sale
- 189 FreeLance Software City
- 1.9K Jobs Available
- 598 Jobs Wanted
- 201 Wanted
- 2.9K Microsoft .NET
- 1.7K ASP.NET
- 1.1K .NET General
- 2.9K Miscellaneous
- 3 Join the Team
- 2 User Profiles
- 353 Comments on this site
- 58 Computer Emulators
- 1.8K General programming
- 137 New programming languages
- 596 Off topic board
- 161 Mobile & Wireless
- 35 Android
- 124 Palm Pilot
- 334 Multimedia
- 151 Demo programming
- 183 MP3 programming
- 0 Bash scripts
- 15 Cloud Computing
- 52 FreeBSD
- 1.7K LINUX programming
- 365 MS-DOS
- 0 Shell scripting
- 319 Windows CE & Pocket PC
- 4.1K Windows programming
- 879 Software Development
- 401 Algorithms
- 67 Object Orientation
- 84 Project Management
- 88 Quality & Testing
- 232 Security
- 7.5K WEB-Development
- 1.8K Active Server Pages
- 61 AJAX
- 2 Bootstrap Themes
- 55 CGI Development
- 19 ColdFusion
- 222 Flash development
- 1.4K HTML & WEB-Design
- 1.4K Internet Development
- 2.2K JavaScript
- 33 JQuery
- 283 WEB Servers
- 108 WEB-Services / SOAP

Welcome to the new platform of Programmer's Heaven! We apologize for the inconvenience caused, if you visited us from a broken link of the previous version. The main reason to move to a new platform is to provide more effective and collaborative experience to you all. Please feel free to experience the new platform and use its exciting features. Contact us for any issue that you need to get clarified. We are more than happy to help you.

jcherring4
Posts: **2**Member

in Java

[b][red]This message was edited by jcherring4 at 2007-3-12 2:25:42[/red][/b][hr]

Look guys i am new to this and got myself behind on this thing can i beg for some help here please help me with this program!!!!!

this is what the display should look like

1. Display the first 25 Fibonacci numbers

2. Display the first 50 Fibonacci numbers

3. Display the first 75 Fibonacci numbers

4. Display the first 125 Fibonacci numbers

5. Display the first 200 Fibonacci numbers

hit me back soon as you can please!

how pleaseeeee

help me with a starting point

read the material that i should have but cant get a start

a sample program could help if

that is not too much to ask

i am in a bind here

Look guys i am new to this and got myself behind on this thing can i beg for some help here please help me with this program!!!!!

this is what the display should look like

1. Display the first 25 Fibonacci numbers

2. Display the first 50 Fibonacci numbers

3. Display the first 75 Fibonacci numbers

4. Display the first 125 Fibonacci numbers

5. Display the first 200 Fibonacci numbers

hit me back soon as you can please!

how pleaseeeee

help me with a starting point

read the material that i should have but cant get a start

a sample program could help if

that is not too much to ask

i am in a bind here

About & Contact / Terms of use / Privacy statement / Publisher: Lars Hagelin

Programmers Heaven articles / Programmers Heaven files / Programmers Heaven uploaded content / Programmers Heaven C Sharp ebook / Operated by CommunityHeaven LLC

© 1997-2013 Programmersheaven.com - All rights reserved.

## Comments

6,349Member: Look guys i am new to this and got myself behind on this thing can i beg for some help here please help me with this program!!!!!

: this is what the display should look like

:

: 1. Display the first 25 Fibonacci numbers

: 2. Display the first 50 Fibonacci numbers

: 3. Display the first 75 Fibonacci numbers

: 4. Display the first 125 Fibonacci numbers

: 5. Display the first 200 Fibonacci numbers

:

: hit me back soon as you can please!

: how pleaseeeee

: help me with a starting point

: read the material that i should have but cant get a start

: a sample program could help if

: that is not too much to ask

: i am in a bind here

:

:

Start by reading about Fibonacci numbers (http://en.wikipedia.org/wiki/Fibonacci_numbers).

Once you are familiar with those, you can start to write a function to find the n-th Fibonacci number. The easiest way to do this, is to check if n > 1 and write a loop from 2 to n which remembers the previous 2 numbers. Example:

[code]

Loop {

previous2 = previous1

previous1 = current

current = previous1 + previous2

}

[/code]

An alternative approach uses a recursive funcion:

[code]

function F(n);

if n > 2 then {

result = F(n-1)+F(n-2)

} else if n = 1 then {

result = 1

} else {

result = 0;

}

[/code]

- Spam

0 · Vote Down Vote Up · Share on Facebook15Member: : [b][red]This message was edited by jcherring4 at 2007-3-12 2:25:42[/red][/b][hr]

: : Look guys i am new to this and got myself behind on this thing can i beg for some help here please help me with this program!!!!!

: : this is what the display should look like

: :

: : 1. Display the first 25 Fibonacci numbers

: : 2. Display the first 50 Fibonacci numbers

: : 3. Display the first 75 Fibonacci numbers

: : 4. Display the first 125 Fibonacci numbers

: : 5. Display the first 200 Fibonacci numbers

: :

: : hit me back soon as you can please!

: : how pleaseeeee

: : help me with a starting point

: : read the material that i should have but cant get a start

: : a sample program could help if

: : that is not too much to ask

: : i am in a bind here

: :

: :

: Start by reading about Fibonacci numbers (http://en.wikipedia.org/wiki/Fibonacci_numbers).

: Once you are familiar with those, you can start to write a function to find the n-th Fibonacci number. The easiest way to do this, is to check if n > 1 and write a loop from 2 to n which remembers the previous 2 numbers. Example:

: [code]

: Loop {

: previous2 = previous1

: previous1 = current

: current = previous1 + previous2

: }

: [/code]

: An alternative approach uses a recursive funcion:

: [code]

: function F(n);

: if n > 2 then {

: result = F(n-1)+F(n-2)

: } else if n = 1 then {

: result = 1

: } else {

: result = 0;

: }

: [/code]

:

- Spam

0 · Vote Down Vote Up · Share on Facebook67Member ✭Read here Fibonacci Series using recursion C Programming

- Spam

0 · Vote Down Vote Up · Share on Facebook