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
- 6341 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 |
Write a program to reverse a single linked list.
List some applications of multilinked structures?
what is the difference between singly and doubly linked lists?
What is adt example?
What are the non linear data structure?
What is best time complexity?
What are the issues that hamper the efficiency in sorting a file?
simple algorithm for bubble sort?
What is data structure operations?
What does arraylist remove return?
How to create your own data structure in java?
Can you list out the areas in which data structures are applied extensively?
Windows 
