Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

class recursion { int func ( int n ) { int result; if ) = = ( 1 return 1 ; result = func (

class recursion
{
int func (int n)
{
int result;
if )==(1
return 1 ;
result = func (n-1);
return result;
}
}
class Output
{
public static void main(String args[])
{
recursion obj = new recursion();
System.out.print(obj. func(5));
}
}
image text in transcribed

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Online Market Research Cost Effective Searching Of The Internet And Online Databases

Authors: John F. Lescher

1st Edition

0201489295, 978-0201489293

More Books

Students also viewed these Databases questions