ple.. briefly describe the purpose of having a base case and
a recursive case in a recursive algorithm
- 2 Answers
- 5848 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 |
What do you mean by recursive definition?
Define data type and what are the types of data type?
What is doubly linked list?
What is the difference between linked list and array?
What is bubble sort with example?
How does dynamic memory allocation help in managing data?
What are data structures in programming?
Write the algorithm for converting infix expression to postfix expression?
Which is the parent class of linkedlist class?
When would you use a tuple?
What do you mean by hash function?
State the rules to be followed during infix to postfix conversions?
Windows 
