program to print all Fibonacci numbers between two given numbers

# program to print all Fibonacci numbers between two given numbers

## program to print all Fibonacci numbers between two given numbers

Page 1 of 1## 4 Replies - 6401 Views - Last Post: 26 May 2009 - 12:55 PM

### #1

# program to print all Fibonacci numbers between two given numbers

Posted 26 May 2009 - 10:05 AM

##
**Replies To:** program to print all Fibonacci numbers between two given numbers

### #2

## Re: program to print all Fibonacci numbers between two given numbers

Posted 26 May 2009 - 10:10 AM

There are 17 gazillion snippets here about Fibonacci numbers. Knock yourself out.

### #3

## Re: program to print all Fibonacci numbers between two given numbers

Posted 26 May 2009 - 11:02 AM

Indeed, there is most definitely a bagillion*10 amount of fibonacci programs on here. It's not too hard once you have the information you need.

### #4

## Re: program to print all Fibonacci numbers between two given numbers

Posted 26 May 2009 - 12:26 PM

void youAnswer(){ while(0==0){ cout<<"\nWhat's your question...\n"; cout<<"\nI'm sorry, but we don't do your work for you here...\n"; cout<<"\nWe only help with code presented...\n"; cout<<"\nThank you...\n"; } return; }

A+ worthy code

This post has been edited by **computerfox**: 26 May 2009 - 12:27 PM

### #5

## Re: program to print all Fibonacci numbers between two given numbers

Posted 26 May 2009 - 12:55 PM

#include <iostream> #include <cmath> void fibonacci(); using namespace std; int main() { double x; double y; cout << "Enter the two numbers to have the sequence calculated from and to" << endl; cin >> x >> y; fibonacci(); return 0; } void fibonacci() { /************************************************************************** All your code should go here if you want to use a function Also, I have basically laid out the simplest part of the program now all you have to do is figure out the formula and how to implement the user numbers into your function of the fibonacci sequence **************************************************************************/ }

This post has been edited by **IngeniousHax**: 26 May 2009 - 12:57 PM

Page 1 of 1