Recursion
Write a recursive function to find Maximum in an array. // Example program #include <iostream> #include <bits/stdc++.h> int findMax(int* A, int i){ if(i==0){ return A[i]; } int max_in_subproblem = findMax(A, i-1); return std::max(A[i],max_in_subproblem); } int main() { int a[10] = {8,6,5,2,9,3,10,1,4,7}; int maximum = findMax(a, 9); std::cout << maximum; } // Example program #include <iostream> #include <string> int factorial(int n){ if(n==0 || n==1){ return 1; } int fact = factorial(n-1); return n * fact; } int main() { int fact = factorial(9); std::cout<< fact; } Write a recursive function to calculate Nth term of Fibonacci. #include <iostream> #include <string> int fibonacci(int n){ if(n==0 || n==1){ return 1; } int fib = fibonacci(n-1) + fibonacci(n-2); return n * fib; } int main() { int fib = fibona...