This is another recursion procedure which is the number of times the procedure is called recursively in the process of enlarging a given argument or arguments. Usually this quantity is not obvious except in the case of extremely simple recursive functions, such as FACTORIAL (N), for which the depth is N.

Recursion is the simplest method for using the same procedure number of times i.e it uses the for loop it repeats until condition true.depth of recursion function in Factorial(N) is N.

The depth of recursion basically depends on the arguments passed in the recursive calls and the no of recursive calls within the function.these recursive calls can be represented using a tree structure where the parent function call(with its own arguments ) have the recursive calls (with their own arguments)as the parents children..In this representation, the growth of the tree height with increase in N gives a bound on the depth of recursion.Also the total no of nodes will give you the depth for a particular 'n' value.

It remains same depth at what depth the first recursion is called.. for example, at 5th depth if recursion is called then 5 will be its depth till recursion ends

Recursion is the simplest method for using the same procedure number of times i.e it uses the for loop it repeats until condition true.depth of recursion function in Factorial(N) is N.

If you have the better answer, then send it to us. We will display your answer after the approval.
Rules to Post Answers in CoolInterview.com:-

There should not be any Spelling Mistakes.

There should not be any Gramatical Errors.

Answers must not contain any bad words.

Answers should not be the repeat of same answer, already approved.

Answer should be complete in itself.

Name :*
Email Id :*
Answer :*
Verification Code	Not readable? Load New Code
Enter the above shown code:*
	Inform me about updated answers to this question