ple.. briefly describe the purpose of having a base case and
a recursive case in a recursive algorithm
- 2 Answers
- 5481 Views
- I also Faced
- E-Mail Answers
Answer Posted / 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 |
Post New Answer View All Answers
How would you swap the Kth node from beginning with Kth node from end in a Linked List.
Differentiate between compilers and interpreters.
You want to insert a new item in a binary search tree. How would you do it?
How many types of linked list are there?
What is the difference between one and two dimensional?
How can we remove loops in a linked list? What are the functions of fast and slow pointers?
Can you please explain the difference between array_name and &array_name?
Is binary tree a bst?
Define primary clustering?
Can arraylist be resized?
Can a hashset contain duplicates?
Is it legal to initialize list like this?
State the difference between persistent and ephemeral data structure?
What does stack top do?
Complete structure of hashmap, very detail description, along with the basic coding of the hashmap internal implementation.
