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
- 6449 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 is dynamic array how it is created?
What is the need of sorting?
Write the recursive c function to count the number of nodes present in a binary tree.
What is the difference between arrays sort and collections sort?
How do you sort pseudocode?
Define data type and what are the types of data type?
What is complete binary tree and almost complete binary tree?
what is a balanced tree.
What is the method to find the complexity of an algorithm?
What data type is array?
What is the difference between arraylist and linkedlist?
Explain what is the data structures used to perform recursion?
Windows 
