public int FindNthFibonacciNumber(int n){ if (n == 1 || n == 2) return 1; int nthfibonacciNumber = FindNthFibonacciNumber(n - 1) + FindNthFibonacciNumber(n - 2); return nthfibonacciNumber;}
Login to post response