Interested to Buy Any Domain ? << Click Here >> for more details...
What do you mean by Base case, Recursive case, Binding Time,
Run-Time Stack and Tail Recursion?
- 2 Answers
- 30732 Views
- TCS, I also Faced
- E-Mail Answers
Answer Posted / wonder surong
These terms are found in Recursion.
1.Base Case:it is the case in recursion where the answer is
known,or we can say the termination condition for a
recursion to unwind back.
For example to find Factorial of num using recursion:
int Fact(int num){
if(num==1 || num==0)//base case
return 1;
else // recursive case:
return num*Fact(num-1);
}
2.Recursive case:It is the case whcih brings us to the
closer answer.
Run Time Stack:It is a system stack us to save the frame
stack of a function every recursion or every call.
This frame stack consists of the return address,local
variables and return value if any.
Tail Recursion:The case where the function consist of
single recursive call and it is the last statement to be
executed.A tail Recursion can be replace by iteration.
The above funtion consists of tail recursion case.
where as the below function does not.
void binary(int start,int end,int el){
int mid;
if(end>start){
mid=(start+end)/2;
if(el==ar[mid])
return mid;
else{
if(el>ar[mid])
binary(mid+1,end,ele);
else
binary(start,mid-11,ele);
}
}
}
| Is This Answer Correct ? | 38 Yes | 2 No |
Post New Answer View All Answers
What is array and string?
What is adt in data structure?
What is the use of heap sort?
Is it possible to store null key and null values in a hashmap?
What is time and space complexity of bubble sort?
What are three common types of traversals?
What is mergesort and hashtable?
How would you swap the Kth node from beginning with Kth node from end in a Linked List.
Can arraylist store int?
What is data structure and its types?
What is the order of selection sort?
What are the classification of data structures?
How to search binary in a sorted array?
What is structured data with example?
What is quick sort?
