Probably, you would see a stack.A recursive algorithm works by calling itself, each time with different data. So, to simulate that without actual recursion, you would need to track the changing data on some kind of stack. This would allow the data to be processed in a last-in-first-out order, which is how recursion works.
Guess you meant: can a recursive function call predefined functions? Answer: sure, why not.
a recursive association - as a aggregation is a special form of association, so recursive aggregation can be called as recursive association ... AKASH SISODIYA ......IT ...
See if the fuction calls itself, if yes, it's recursive otherwise it's not a recursive function.
Something that is recursive is something that repeats.
None of them is, obviously.
The term recursive refers to the recurrence or repetition.
All recursive Languages are recursively enumerable. But not all the recursively enumerable languages are recursive. It is just like NP complete.
no it is not recursive
Recursive refers to using a rule or procedure that can be applied repeatedly.
a function that recalls itself again and again is called recursive relationship.