0
A recursive function is one that calls upon itself until a given result in the original call is met.
Take a look at this example.
Program Recursion;
Uses
crt;
Var
number:longint;
Function Factorial(number:longint):longint;
Begin
if number > 0 then
factorial:=number*factorial(number-1)
else
factorial:=1;
End;
Begin
clrscr;
readln(number);
writeln(factorial(number));
readln;
End.
Note how the function factorial calls itself.
A recursive function does have an element of repetition.
However, it should never repeat its actions verbatim - or this would create an infinite recursion.
A recursive function has one or more base cases - where the function simply returns a value.
A recursive function also has one or more recursive cases- where the function calls itself with a different ("smaller") input, and may combine the results of these calls.
Please see the related links for further discussion.
Add your answer:
Earn +20 pts
Is macro a recursive function?
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.
What is a recursive relationship?
a function that recalls itself again and again is called recursive relationship.
Difference between function and recursive variable?
A function can map for sets with infinite elements. Recursive variables, being 'algorithms of algorithms', are restricted to finite elements.
What is the maximum depth of recursive calls a function may make?
Recursive function call depend your primary memory space because the recursive call store in stack and stack based on memory.
The efficiency of using recursive function rather than using ordinary function?
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.
What is the difference between function and recursive function?
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.
Is macro a recursive function?
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.
What is a recursive relationship?
a function that recalls itself again and again is called recursive relationship.
Can you use main function as a recursive function in C?
Yes
Difference between function and recursive variable?
A function can map for sets with infinite elements. Recursive variables, being 'algorithms of algorithms', are restricted to finite elements.
What is the definition of non recursive in c?
non recursive function is excuted faster than recrussive
What is the maximum depth of recursive calls a function may make?
Recursive function call depend your primary memory space because the recursive call store in stack and stack based on memory.
The efficiency of using recursive function rather than using ordinary function?
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.
What do you call a function recurative?
I guess it would be 'recursive'.
Primitive recursive operation Exponential function in theory of computation?
equals(x,y)=1 if x=y =0 otherwise show that this function is primitive recursive
Does javascript support recursive functions?
Yes, but a recursive function running for a long time would eventually cause your program to crash.
How are recursive rules different from explicit function rules for modeling linear data?
recursive rules need the perivius term explicit dont
