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
- 6304 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 for Linked list manipulation.
which is the simplest file structure? (Sequential, indexed, random)
How can I study data structures and algorithms?
What is the need for path compression?
Explain what is the bucket size, when the overlapping and collision occur at same time?
In depth questions regarding the data structures and the Databases used in the Projects developed.
create an singly linked lists and reverse the lists by interchanging the links and not the data?
Define an abstract data type (adt)?
Define a stack?
How does the bubble sort work?
Is arraylist synchronized?
What is structure of data type?
Windows 
