Interested to Buy Any Domain ? << Click Here >> for more details...
What is the data structures used to perform recursion?
- 1 Answers
- 2159 Views
- I also Faced
- E-Mail Answers
Answer / phool chand
Stack. Because of its LIFO (Last In First Out) property it remembers its ‘caller’ so knows whom to return when the function has to return. Recursion makes use of system stack for storing the return addresses of the function calls. Every recursive function has its equivalent iterative (non-recursive) function. Even when such equivalent iterative procedures are written, explicit stack is to be used.
| Is This Answer Correct ? | 0 Yes | 0 No |
Define an algorithm. What are the types of algorithms?
Tell me is it better to use a pointer to navigate an array of values, or is it better to use a subscripted array name?
Why is arraylist not thread safe?
What is faster array or arraylist?
Why arraylist is not efficient for manipulation?
We know that Arrays are objects so why cannot we write strArray.length()?
Is json a data structure?
Is arraylist heterogeneous?
Explain about the different lists available in the collection?
Stack can be described as a pointer. Explain.
How much time does it take to learn data structures?
What is the difference between null and void?
Windows 
