If you're asking if the c preprocessor supports recursive macros, the answer is no. The preprocessor is single-pass and since the "function" must be defined before it can be referenced, it can not be recursive.
This may seem like a silly question, but you will gain some knowledge on the inner working of the preprocessor of the recursive macro expansion. It will actually require a lot of scripts.
a function that recalls itself again and again is called recursive relationship.
A function can map for sets with infinite elements. Recursive variables, being 'algorithms of algorithms', are restricted to finite elements.
Recursive function call depend your primary memory space because the recursive call store in stack and stack based on memory.
For some algorithms recursive functions are faster, and there are some problems that can only be solved through recursive means as iterative approaches are computationally infeasible.
I will explain in the easiest way the difference between the function and recursive function in C language. Simple Answer is argument of the function is differ but in the recursive function it is same:) Explanation: Function int function(int,int)// function declaration main() { int n; ...... ...... n=function(a,b); } int function(int c,int d) { ...... ...... ...... } recursive Function: int recursive(int,int)// recursive Function declaration main() { int n; ..... ..... ..... ..... n=recursive(a,b); } int recursive(int a,int b) { ..... .... .... .... } Carefully see, In the recursive Function the function arguments are same.
This may seem like a silly question, but you will gain some knowledge on the inner working of the preprocessor of the recursive macro expansion. It will actually require a lot of scripts.
a function that recalls itself again and again is called recursive relationship.
Yes
A function can map for sets with infinite elements. Recursive variables, being 'algorithms of algorithms', are restricted to finite elements.
In VBA, a macro is the name for the function that you can see on the GUI and use, and a function is a procedure called by a macro. A Macro is more "on the stage", and a Function is more "backstage".
non recursive function is excuted faster than recrussive
Recursive function call depend your primary memory space because the recursive call store in stack and stack based on memory.
For some algorithms recursive functions are faster, and there are some problems that can only be solved through recursive means as iterative approaches are computationally infeasible.
I guess it would be 'recursive'.
equals(x,y)=1 if x=y =0 otherwise show that this function is primitive recursive
Yes, but a recursive function running for a long time would eventually cause your program to crash.