Question: C++ programming Given the following recursive function ( use type long because the int type is not big enough to hold the output number) long
C++ programming

Given the following recursive function ( use type long because the int type is not big enough to hold the output number) long f(int n) { if(n==1) return 2; else return 2*f( n-1); } a. What is the run-time of this recursive function? b. Write a program to find and display the value of f( 20 ), and display its run-time
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
