Question: 1 . Given a recursive algorithm as below: int F ( int n ) { if ( n < = 1 ) return 1 ;

1. Given a recursive algorithm as below:
int F(int n)
{
if (n <=1) return 1;
else if ( n %2==0) return F(n-1)+ n;
else return F(n/2)1;
}
Illustrate how you will find out the value of F(10) using the above algorithm. You need to show all the steps.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!