Best Answer

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.

Q: What is the difference between function and recursive function?

Write your answer...

Submit

Still have questions?

Continue Learning about Basic Math

gffg

Girraf

We can access a Friend function from any other class in which friend function is introduced or declared even if the other class is not a member of first class. But when we use normal member function, we can have its access only in the derived classes of the first class. This is the basic difference between a friend function and a normal member function.

The print function is slightly more dynamic than the echo function by returning a value, and the echo function is slightly (very slightly) faster. The printf function inserts dynamic variables/whatever into wherever you want with special delimiters, such as %s, or %d. For example, printf('There is a difference between %s and %s', 'good', 'evil') would return 'There is a difference between good and evil'.

The objective of a water supply it to get water into houses. The function of the pipe it to carry that water and the function of a tap is to control the flow of the water.

Related questions

A function can map for sets with infinite elements. Recursive variables, being 'algorithms of algorithms', are restricted to finite elements.

All recursive Languages are recursively enumerable. But not all the recursively enumerable languages are recursive. It is just like NP complete.

what is the recursive formula for this geometric sequence?

A recursive system is one in which the output is dependent on one or more of its past outputs while a non recursive system is one in which the output is independent of any past outputs.e.g feedforward system having no feedback is a non recursive system.

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.

a function that recalls itself again and again is called recursive relationship.

A: Un+1 = Un + d is recursive with common difference d.B: Un+1 = Un * r is recursive with common ratio r.C: The definition seems incomplete.A: Un+1 = Un + d is recursive with common difference d.B: Un+1 = Un * r is recursive with common ratio r.C: The definition seems incomplete.A: Un+1 = Un + d is recursive with common difference d.B: Un+1 = Un * r is recursive with common ratio r.C: The definition seems incomplete.A: Un+1 = Un + d is recursive with common difference d.B: Un+1 = Un * r is recursive with common ratio r.C: The definition seems incomplete.

Yes

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'.