Interested to Buy Any Domain ? << Click Here >> for more details...
ple.. briefly describe the purpose of having a base case and
a recursive case in a recursive algorithm
- 2 Answers
- 6549 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 |
Can we put null value in hashmap?
What is the top of a stack?
how a polynomial such as 6x^6+4x^3-2x+10 can be represnted by linked list?write an algorithm that reads such an polynomial
Which algorithm is used in collections sort method?
What is data structure? Explain.
Explain Linked List
Which interfaces are implemented by hashmap?
What are the types of binary tree?
How arraylist increase its size?
Why is sorting necessary?
What is map entry?
What do you mean by sorting?
Windows 
