ple.. briefly describe the purpose of having a base case and
a recursive case in a recursive algorithm
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
Mention a few applications of linked lists?
What is an externalizable interface?
What do you mean by priority queue?
Why do we need linked lists?
Given an array of integers, devise a program to replace every element with the next greatest element on the right side in the array. Also, replace the last element with 5 as there no element on the right side of it.
Explain what are the methods available in storing sequential files ?
Which is faster arraylist or hashmap?
What is complete binary tree in data structure?
What is an example of an algorithm?
What are the advantages of bubble sort?
How to reverse a singly linked list?
State the difference between queues and linked lists?
What is mean by abstract data type?
Is priority queue sorted?
What are the types of array operations?