Elysian Shadows

Code: Select all

#include <iostream>

using namespace std;

int fib(int n);

int main() {

	int n, answer;

	cout << "\t\t\t Fibonacci Using Recursion\n\n";
	cout << "Enter the number to find: ";
	cin >> n;

	cout << "\n\n";

	answer = fib(n);

	cout <<  answer << " is the " << n << "th Fibonacci number.\n";

	return 0;

}

int fib(int n){

	cout << "Processing fib(" << n << ")...";
	
	if (n < 3) {
		cout << "Return 1!\n";
		return 1;
	}
	else {
		cout << "Call fib(" << n-2 << ") and fib(" << n-1 << ").\n";
		return( fib(n-2) + fib(n-1) );
	}

}

Code: Select all

#include <iostream>

// Function prototype(s)
int fib(int position);

int main() {

	int answer,position;
	
	// Displays Question and assigns anser to variable "position"
	std::cout << "Which position in the Fibonacci Sequence would you like to view?\n";
	std::cin >> position;
	std::cout << std::endl;

	//passes position to the fib function to be solved.
	answer = fib(position);
	
	// displays the answer
	std::cout << answer << " is the  ";
	std::cout << position << "th Fibonacci number.\n";
	
	// returns 0 so windows or some other program won't detect an error.
	return 0;
}

//Finds the passed position in the Fibonacci sequence

int fib(int n) {

	int minusTwo=1, minusOne=1, answer = 2;
	
	//checks to see if you inputted something less than 3, if so the anser is 1, so return it.
	if (n < 3) 
		return 1;
	
	//go through sequence until position is reached, then return value at corresponding position.
	for (n -= 3; n; n--) {
		minusTwo = minusOne;
		minusOne = answer;
		answer = minusOne + minusTwo;
	}
	
	//Return the answer
	return answer;

}

Code: Select all

#include<iostream.h>
void fibb(unsigned long int x,unsigned long int y,unsigned long int a,unsigned long int b){
     if(x==y)cout<<a+b<<"\n";
     else{cout<<a+b<<"\n";
           fibb(x,++y,b,a+b);}}
main()
{
    unsigned long int x;
    system("title Fibbonacci Sequence");
    cin>>x;
    system("cls");
    fibb(x,1,0,1);
    system("PAUSE");
}