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
- 6541 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 are the average and worst time complexity in a sorted binary tree is
How many types of search algorithms are there?
What is a data structure? What are the types of data structures? Briefly explain them
Define hashing?
How do you separate zeros from non-zeros in an array?
what is atmost complete binary tree?
What is the difference between a stack and an array?
What is significance of ” * ” ?
Define path in a graph?
Why might quick sort might be better than merge sort?
Given an unsorted linked list, and without using a temporary buffer, write a method that will delete any duplicates from the linked list?
Which file contains the definition of member functions?
Windows 
