Write a C++ program to find the nth Fibonacci number using recursion.

Sure , I ' d be happy to help you with that ! Here ' s a C ++ program that finds the n th F ib on acci number using recurs ion : \n `` ` \n # include <</a> i ostream \n using namespace std ; \n int fib on acci ( int n ) { \n if ( n <= 1 ) { \n return n ; \n } else { \n return fib on acci ( n - 1 ) + fib on acci ( n - 2 ); \n } \n } \n int main () { \n int n ; \n cout << " Enter the value of n : "; \n cin n ; \n cout << " The " << n << " th F ib on acci number is : " << fib on acci ( n ) << endl ; \n return 0 ; \n } \n `` ` \n This program prom pts the user to enter the value of ` n `, which represents the position of the F ib on acci number to find found . It then calls the ` f ib on acci ` function , which uses recurs ion to calculate the F ib on acci number . The function returns the n th F ib on acci number , which is then printed to the console . \n Note that this program uses recurs ion , which can be in efficient for large values of ` n `. For larger values of ` n `, it ' s better to use an iter ative approach or memo ization to improve performance . </s>