Hello, OnlineGDB Q&A section lets you put your programming query to fellow community users. Asking a solution for whole assignment is strictly not allowed. You may ask for help where you are stuck. Try to add as much information as possible so that fellow users can know about your problem statement easily.
Login
Login
OnlineGDB Q&A
Questions
Unanswered
Tags
Ask a Question
Ask a Question
write a java program to find the factorial of a given number using recursion and analyze the time complexity
+1
vote
asked
Dec 26, 2019
by
anonymous
Your answer
Your name to display (optional):
Email me at this address if my answer is selected or commented on:
Email me if my answer is selected or commented on
Privacy: Your email address will only be used for sending these notifications.
Anti-spam verification:
To avoid this verification in future, please
log in
or register.
1 Answer
0
votes
answered
Dec 31, 2019
by
anonymous
class Main
{
public static void main(String[] ar)
{
int n;
scanner sc=new Scanner(System.in);
n=sc.nextInt();
int x=fact(n);
System.out.println(x);
}
int fact(int n)
{
if(n==1)
return 1;
else
return n*fact(n-1)
}
}
commented
Jan 4, 2020
by
Pavan Cheruvu
(
100
points)
Which is the code which is related to analysis of time complexity ?
Your comment on this answer:
Your name to display (optional):
Email me at this address if a comment is added after mine:
Email me if a comment is added after mine
Privacy: Your email address will only be used for sending these notifications.
Anti-spam verification:
To avoid this verification in future, please
log in
or register.
Welcome to OnlineGDB Q&A, where you can ask questions related to programming and OnlineGDB IDE and and receive answers from other members of the community.
...