this question depends on what the recursion is being used for.....
sumit kumar srivastava
9455587002
Recursion is used for backtracking
Binary Search is the high speed data searching.Here in each recursion the is divided in two equal halves so that execution becomes easier.
Heap is a data-structure, it cannot implement anything. On the other hand, it is true that: 1. Recursive routines might use heap. 2. You can use dynamic memory allocation (heap), to implement a stack; and use the stack to implement recursion.
You create your own data structure in database.
data structure is a way of storing data in a computer so that it can be used efficientlyan algorithm is a sequence of instructions, often used for calculation and data processing.Often a carefully chosen data structure will allow the most efficient algorithm to be used.
The GRAPH data structure used behind Facebook.for more detail see
No, a data structure is a particular way of storing and organizing data in a computer so that it can be used efficiently.
array
stack data structure.
Some sort of structure that lets you store a list of pending jobs - for example, an array, but it would have to be a resizable array. Some type of collection might be more appropriate. As you process one level of recursion, you add the "children" (which have yet to be processed) to the collection of pending jobs; once the "parent" is done processing, you remove it from the collection.
To arrange data in a particular manner.these manner or set of rules is defined in the data structure so that the data used in computer systems can properly used at necessary time.
To arrange data in a particular manner.these manner or set of rules is defined in the data structure so that the data used in computer systems can properly used at necessary time.