Fibonacci using Recursion

[Vandalism]

Make a program that will determine the fibonacci at the desired position number using recursion. Example:

Enter the first Fibonacci number: 12
Enter the second Fibonacci number: 18
Enter the position of the desired Fibonacci number: 15
The Fibonacci number at position 15 is: 9582

 #include<iostream>
using namespace std;


int fibonacci(int first, int second, int position = 1)
{
	int counter = 0, n;
	if (counter <= position)
	{
		n = first + second;
		n = first;
		first = second;
		counter++;
		position++;
		return fibonacci(first, second, position);
	}
}

int main()
{
	int first, second, position, n, counter;

	cout << "Enter the first fibonacci number: ";
	cin >> first;
	cout << "Enter the second fibonacci number: ";
	cin >> second;
	cout << "Enter the position of the desired fibonacci: ";
	cin >> position;

	cout << "The fibonacci number at position " << position << " is: " << fibonacci(first, second, position);

	system("pause>0");
	return 0;
}

[Vandalism]

I changed this part but it still breaks

if (counter <= position)
	{
		n = first + second;
		first = n;
		second = first;
		counter++;
		position++;
	}

[Semoirethe]

Trace the recursion(aka what does the function return in the base case?)

[Kyi]

#include<iostream>
using namespace std;


int fibo(int first, int second, int position)
{
	int counter = 0, sum;
	while(counter < position-2)
	{
		sum = first + second;
		first = second;
		second=sum;
		counter++;
	}
	return sum;
}

int main()
{
	int first, second, position, n, counter;

	cout << "Enter the first fibonacci number: ";
	cin >> first;
	cout << "Enter the second fibonacci number: ";
	cin >> second;
	cout << "Enter the position of the desired fibonacci: ";
	cin >> position;

	cout << "The fibonacci number at position " << position << " is: " << fibo(first, second, position);

	system("pause>0");
	return 0;
}

You have to use "while" loop instead of "if" loop if you want to repeat it a certain amount of time ie fibo is generated by summing the adjacent numbers again and again. Besides, return should be the value you want to cout ie the function can't return itself. Also, there are a little bit misconcepts. Look at my code.

[Semoirethe]

To Kyi's answer, that's not a recursive fibonacci. A recursive fibonacci DOES return itself. However that is indeed a correct iterative fibonacci.

[fg109]

A function is recursive if it calls itself. This is how the recursion part should be:

int fibo(int first, int second, int position)
{
    if (position < 1)
        throw std::invalid_argument("No position exists before the first element in a sequence.\n");
    else if (position == 1)
        //stuff
    else if (position == 2)
        //stuff
    else
    {
        //stuff
        return fibo(first, second, position - 1);
    }
}

Please don't tell me you can't figure out the rest from here.