ple.. briefly describe the purpose of having a base case and
a recursive case in a recursive algorithm
- 2 Answers
- 5901 Views
- I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / arka
Lets assume factorial function defined recursively:
int fact(int n)
{
if(n==0||n==1)
return(1); //base case
else
return(n*fact(n-1)); //recursive case
}
the necessity for recursive case is simply recursion
whereas the base case is needed to terminate the recursion.
eg:fact(4)=>4*fact(3)=>4*3*fact(2)=>4*3*2*fact(1)=4*3*2*1.
for fact(1) hte base case is satisfied and the function
fact is not called again.
| Is This Answer Correct ? | 15 Yes | 0 No |
Answer / baskar
In recursive algorithm.
1. Base case gives the condition for recursive algorithm
when the recursive call is stop.
2.recursive case vice versa.
| Is This Answer Correct ? | 6 Yes | 0 No |
How do you explain bubble sort?
What is complexity algorithm?
What is data structure explain in detail?
What is unhashable type list?
Which time complexity is best?
Is map a collection?
Explain the uses of binary tree.
What is data structures in computer science?
How will you explain circular linked list?
Which is the parent class of list<e> class?
What is array and structure?
What are the applications of priority queues?
Windows 
